Datasets:

TnT

/

Multi_CodeNet4Repair

like 9

p02546

u754511616

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

["a=input()\nif a[-1]==s:\n print(a+'es')\nelse:\n print(a+'s')", "n=input()\nif n[-1]=='s':\n print(n+'es')\nelse :\n print(n+'s')"]

['Runtime Error', 'Accepted']

['s975185806', 's769210271']

[9092.0, 9052.0]

[22.0, 24.0]

[59, 66]

p02546

u771383254

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

["s = input()\n\nif s[-1] == 's':\n print((s+'s'))\nelse:\n print(s+'es')", "s = input()\n\nif s[-1] != 's':\n print((s+'s'))\nelse:\n print(s+'es')"]

['Wrong Answer', 'Accepted']

['s157993021', 's878618029']

[9084.0, 9088.0]

[32.0, 27.0]

[68, 68]

p02546

u774959455

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

['N = int(input().strip())\n\n\n\na = []\nc =0\nf = 0\n\nfor i in range(N):\n array = list(map(int, input().strip().split()))\n a.append(array)\n\n \nfor i in range(N):\n\tif(f == 0 or f == i-1):\n\t\tif(a[i][0] == a[i][1]):\n\t\t\tf=i\n\t\t\tc+=1\n\t\telse:\n\t\t\tf=0\n\t\t\tc=0\n\telse :\n f=0\n c=0\n\nif(c >= 3):\n print("Yes")\nelse:\n print("No")', 'N = int(input().strip())\n\n\n\na = []\nc =0\nf = 0\n\nfor i in range(N):\n array = list(map(int, input().strip().split()))\n a.append(array)\n\n \nfor i in range(N):\n\tif(f == 0 or f == i-1):\n\t\tif(a[i][0] == a[i][1]):\n\t\t\tf=i\n\t\t\tc+=1\n\t\telse:\n\t\t\tf=0\n\t\t\tc=0\n\telse :\n\t\tf=0\n\t\tc=0\n\nif(c >= 3):\n print("Yes")\nelse:\n print("No")', 'N = int(input().strip())\n\n\n\na = []\nc = []\nf = 0\n\nfor i in range(N):\n array = list(map(int, input().strip().split()))\n a.append(array)\n\n \nfor i in range(N):\n\tif(f == 0 or f == i-1):\n\t\tif(a[i][0] == a[i][1]):\n\t\t\tf=i\n\t\t\tc.append(1)\n\t\telse:\n\t\t\tf=0\n\n\nif(len(c) >= 3):\n print("Yes")\nelse:\n print("No")', 'import sys\nN = int(input().strip())\n\nif(N == 0):\n sys.exit()\n\n\n\na = []\nc =0\nf = 0\nfor i in range(N):\n array = list(map(int, input().strip().split()))\n a.append(array)\n#print(a[4][1])\nfor i in range(N):\n\tif(f == 0 or f == i-1):\n\t\tif(a[i][0] == a[i][1]):\n\t\t\tf=i\n\t\t\tc+=1\n\t\telse:\n\t\t\tf=0\n\t\t\tc=0\nif(c >= 3):\n print("Yes")\nelse:\n print("No")', "val = input()\n\nif(val[-1] == 's'):\n print(val + 'es')\nelse:\n print(val+'s')"]

['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']

['s790760346', 's848448533', 's906238309', 's972145719', 's696300371']

[8904.0, 9100.0, 9204.0, 9112.0, 8992.0]

[31.0, 24.0, 24.0, 29.0, 30.0]

[326, 318, 306, 343, 77]

p02546

u777800738

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

["import numpy as np\nnum=input().split(' ')\ncount=0\nplot=np.zeros([int(num[0]),int(num[0])])\nt=[]\nfor a in range(int(num[1])):\n tmp=input().split(' ')\n t.append([int(tmp[0])+a for a in range(int(tmp[1])-int(tmp[0])+1)])\nfor a in range(int(num[0])):\n if a==0:\n plot[0,0]=1\n else:\n for posit in np.where(plot[a-1]>0)[0]:\n for b in t:\n for c in b:\n if posit+c<int(num[0]):\n\t plot[a,posit+c]+=plot[a-1,posit]\nxx=int(np.sum(plot[:,-1]))\nprint(xx%998244353)", "a=input()\nif a[-1]=='s':\n print(a+'es')\nelse:\n print(a+'s')"]

['Runtime Error', 'Accepted']

['s911398772', 's352219496']

[27108.0, 9020.0]

[113.0, 30.0]

[489, 61]

p02546

u813042907

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

['x=input()\nif x[-1]==\'s\'\n x+="es"\nelse:\n x+="s"\n \nprint(x)', 'x=input()\n\nif x[-1]==\'s\':\n\n x+="es"\n\nelse:\n\n x+="s"\n\n \n\nprint(x)']

['Runtime Error', 'Accepted']

['s390017061', 's267736783']

[8960.0, 9008.0]

[29.0, 31.0]

[60, 67]

p02546

u814882849

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

["string = input('入力して下さい')\nif string.endswith('s'):\n print(string + 'es')\nelse:\n print(string + 's')", "string = input('')\nif string.endswith('s'):\n print(string + 'es')\nelse:\n print(string + 's')"]

['Wrong Answer', 'Accepted']

['s014468993', 's255571450']

[9048.0, 8884.0]

[27.0, 30.0]

[119, 98]

p02546

u816552564

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

['x=input()\nif x[-1]="s":\n print(x"es")\nelse:\n print(x"s")', 'x=input()\nif x[-1]=="s":\n print(f"{x}es")\nelse:\n print(f"{x}s")']

['Runtime Error', 'Accepted']

['s822404968', 's965853059']

[9004.0, 8952.0]

[25.0, 31.0]

[58, 65]

p02546

u817565863

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

["p =list(input())\nif p[len(p) - 1] == 's':\n p.append('es')\n print(str(p))\nelse:\n p.append('s')\n print(p)\n\n", "p=input()\nif p[len(p)-1]=='s':\n p.append('es')\n print(p)\nelse:\n p.append('s')\n print(p)\n ", "p =input()\nif p[len(p) - 1] == 's':\n print(p+'es')\nelse:\n print(p+'s')\n\n"]

['Wrong Answer', 'Runtime Error', 'Accepted']

['s868939538', 's976586160', 's173172589']

[9028.0, 8956.0, 9084.0]

[27.0, 30.0, 30.0]

[117, 94, 78]

p02546

u842033632

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

["S = input()\nif S[-1] == s\n\tprint(S + 'es')\nelse:\n \tprint(S + 's')", "S = input()\nif S[-1] == 's':\n\tprint(S + 'es')\nelse:\n \tprint(S + 's')"]

['Runtime Error', 'Accepted']

['s690885254', 's572571452']

[8968.0, 9084.0]

[25.0, 28.0]

[65, 68]

p02546

u842969201

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

['s = input()\nif s[-1]=="s":print(s+"es")\nelse:print(s+"es")\n\n', 's=input()\nif s[-1]=="s":print(s+"es")\nelse:print(s+"s")\n']

['Wrong Answer', 'Accepted']

['s332259943', 's771618762']

[9076.0, 8984.0]

[29.0, 31.0]

[60, 56]

p02546

u848097937

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

['s = input\nif Taknese == s:\nprint("Takneses")\nelse:\n print("Taknese")\n \nif apple == s:\nprint("apples")\nelse:\n print("apple")\n \nif bus == s:\nprint("buses")\nelse:\n print("bus")', ' \ns=input()\nif s[-1]=="s":\n print(s+\'es\')\nelse:\n print(s+\'s\')']

['Runtime Error', 'Accepted']

['s250133336', 's686747980']

[9032.0, 9032.0]

[25.0, 26.0]

[178, 67]

p02546

u854931881

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

['n=input()\nif n[len(n)-1]=="s":\n n.append("es")\nelse:\n n.append("s")\nprint("".join(n))', 'n=list(input())\nif n[len(n)-1]=="s":\n n.append("es")\nelse:\n n.append("s")\nprint("".join(n))\n']

['Runtime Error', 'Accepted']

['s180269040', 's620250502']

[9024.0, 9032.0]

[21.0, 26.0]

[87, 94]

p02546

u865520181

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

['import sys\nS=""\nS=sys.argv[1]\nif S[-1] == \'s\':\n S=S+\'es\'\nelse:\n\tS=S+\'s\'\nprint(S)\n', 'import sys\nS=""\nS=sys.argv[1]\nif S[-1] == \'s\':\n S=S+\'es\'\nelse:\n\tS=S+\'s\'\nprint(S)\n', 'import sys\nS=""\nS=sys.argv[1]\nlen(S)<=1000\nif S[-1] == \'s\':\n S=S+\'es\'\nelse:\n\tS=S+\'s\'\nprint(S)', "S=input()\nif S[-1] == 's':\n\tS=S+'es'\nelse:\n\tS=S+'s'\nprint(S)\n"]

['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']

['s340858285', 's536145523', 's644362401', 's337415852']

[9020.0, 9088.0, 9012.0, 9048.0]

[24.0, 25.0, 29.0, 30.0]

[83, 83, 95, 61]

p02546

u867616076

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

["s = raw_input()\nif(s[-1] == 's'):\n s += 'es'\nelse:\n s += 's'\nprint(s)\n", "s = input()\nif(s[-1] == 's'):\n s += 'es'\nelse:\n s += 's'\nprint(s)\n"]

['Runtime Error', 'Accepted']

['s031404546', 's242415424']

[9048.0, 9032.0]

[24.0, 28.0]

[76, 72]

p02546

u872259176

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

["s = input()\nl = len(s)\nif(s[l - 1]) == 's':\n\tl.append(es)\nelse:\n \tl.append(s)\nprint(s)", 's = input()\nl = len(s)\nif(s[l - 1]) == s:\n\tl.append(es)\nelse:\n \tl.append(s)\nprint(s)', 's = input()\nl = len(s)\nif s[l - 1] == s:\n\tl.append(es)\nelse:\n \tl.append(s)\nprint(s)', 's = input()\nl = len(s)\nif s[l - 1] == "s":\n\ts += "es"\nelse:\n \tl.append("s")\nprint(s)', 's = input()\nif s[-1] == "s":\n\ts += "es"\nelse:\n \ts += "s"\nprint(s)']

['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']

['s189546365', 's309293157', 's353319048', 's705432195', 's708780949']

[8916.0, 9020.0, 9084.0, 8964.0, 8940.0]

[25.0, 29.0, 23.0, 28.0, 27.0]

[86, 84, 83, 84, 65]

p02546

u873939138

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

['N = int(input(""))\nd = 0\nfor a in range(N):\n for b in range(N):\n for c in range(N):\n if a*b+c == N:\n d += 1', 'import sys\ninput = sys.stdin.readline\nN = int(input())\nd = 0\nfor a in range(1,N):\n for b in range(1,N):\n for c in range(1,N):\n if a*b+c == N:\n d += 1\nprint(d)', 'for y in range(10**3):\n for z in range(10**3):\n if 1+y*y == 2*z:\n print("x=1,y="+str(y)+",z="+str(z))', 'N = int(input(""))\nd = 0\nfor a in range(N):\n for b in range(N):\n for c in range(N):\n if a*b+c == N:\n d += 1\nprint(d)', 'S = input("")\nif S[-1] == "s":\n print(S+"es")\nelse:\n print(S+"s")']

['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted']

['s083878508', 's461550465', 's506763093', 's544705981', 's753130130']

[9156.0, 9160.0, 8992.0, 9144.0, 9084.0]

[27.0, 26.0, 161.0, 28.0, 28.0]

[123, 174, 110, 132, 67]

p02546

u883375836

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

['input=(S)\nif S[-1]!="s":\n \tprint(S+"s")\nelif S[-1]=="s":\n \tprint(S+"es")', 'S=input()\nif S[-1]=="s":\n \tprint(S+"es")\nelse:\n \tprint(S+"s")']

['Runtime Error', 'Accepted']

['s388133068', 's779526309']

[8956.0, 9092.0]

[28.0, 28.0]

[74, 63]

p02546

u887442481

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

["word = input()\nif(word[-s] == 's'):\n\tprint(word+'es')\nelse:\n\tprint(word+'s')", "word = input()\n\tif(word[-1] == 's'):\n \t\tprint(word+'es')\n \telse:\n print(word+'s')", "word = input()\n\tif(word[-s] == 's'):\n \tprint(word+'es')\n else:\n \tprint(word+'s')", "word = input()\n\tif(word[-s] == 's'):\n \tprint(word+'es')\n else:\n \tprint(word+'s')", "word = input()\nif(word[-1] == 's'):\n\tprint(word+'es')\nelse:\n\tprint(word+'s')"]

['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']

['s527231045', 's639113757', 's951217656', 's985864300', 's957757106']

[9016.0, 8996.0, 9004.0, 8936.0, 9080.0]

[31.0, 25.0, 22.0, 27.0, 30.0]

[76, 87, 89, 89, 76]

p02546

u889282850

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

["word = input()\n\nlast = word[-1]\n\nif last == 's':\n word = f'{word}es'\nelse:\n word = f'{word}s'\n \n", "word = input()\n\nif word[-1] == 's':\n word = f'{word}es'\nelse:\n word = f'{word}s'\n \nprint(word)"]

['Wrong Answer', 'Accepted']

['s579304692', 's907942060']

[9076.0, 9032.0]

[25.0, 32.0]

[99, 97]

p02546

u894134667

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

["S = input()\n\nprint(S[-1])\nif S[-1] == 's':\n print(S + 'es')\nelse:\n print(S + 's')", "\nS = input()\n\nif S[-1] == 's':\n print(S + 'es')\nelse:\n print(S + 's')"]

['Wrong Answer', 'Accepted']

['s370999182', 's672223731']

[8940.0, 9024.0]

[35.0, 30.0]

[87, 75]

p02546

u894606367

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

["n = int(input()) \nnum_list = []\nfor i in range(n):\n num_list.append(list(map(int,input().split())))\n\nans = []\nfor i in range(n):\n a = num_list[i]\n a1= a[0]\n a2 = a[1]\n if a1 == a2:\n ans.append(1)\n if i > 1 and ans[i-2] == 1 and ans[i-1] == 1 and ans[i] == 1:\n print('Yes')\n break\n else:\n ans.append(0)\nif len(ans) == n:\n print('No')\n", "n = input()\nif n[-1] == 's':\n print(n+'es')\nelse:\n print(n+'s')"]

['Runtime Error', 'Accepted']

['s821406856', 's397049182']

[9196.0, 9020.0]

[24.0, 30.0]

[362, 65]

p02546

u903082918

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

['""" A\n"""\nimport sys\nimport math\nfrom functools import reduce\nfrom bisect import bisect_left\n\ndef readString():\n return sys.stdin.readline()\n\ndef readInteger():\n return int(readString())\n\ndef readStringSet(n):\n return sys.stdin.readline().split(" ")[:n]\n\ndef readIntegerSet(n):\n return list(map(int, readStringSet(n)))\n\ndef readIntegerMatrix(n, m):\n return [lambda _: readIntegerSet(m) for _ in range(0, n)]\n\ndef main(S):\n return S + "es" if S.endswith("s") else S + "s"\n\nif __name__ == "__main__":\n _S = readString()\n\n print(main(_S))', '""" A\n"""\nimport sys\nimport math\nfrom functools import reduce\nfrom bisect import bisect_left\n\ndef readString():\n return sys.stdin.readline()\n\ndef readInteger():\n return int(readString())\n\ndef readStringSet(n):\n return sys.stdin.readline().split(" ")[:n]\n\ndef readIntegerSet(n):\n return list(map(int, readStringSet(n)))\n\ndef readIntegerMatrix(n, m):\n return [lambda _: readIntegerSet(m) for _ in range(0, n)]\n\ndef main(S):\n return S + "es" if S.endswith("s") else S + "s"\n\nif __name__ == "__main__":\n _S = readString().rstrip()\n\n print(main(_S))']

['Wrong Answer', 'Accepted']

['s276418907', 's841422724']

[9504.0, 9500.0]

[35.0, 29.0]

[559, 568]

p02546

u910358825

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

['N=int(input())\na=1\ncount=0\nwhile a<N:\n b=1\n #print(a,b)\n for i in range(N//a+1):\n c=N-a*b\n if c>0:\n count+=1\n #print(a,b,c)\n b+=1\n a+=1\nprint(count)', 'moji=input()\nc=len(moji)\nif moji[c-1]=="s":\n print(moji+"es")\nelse:\n print(moji+"s")']

['Runtime Error', 'Accepted']

['s507890020', 's964304418']

[9128.0, 9024.0]

[23.0, 25.0]

[171, 86]

p02546

u914883924

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

['S=input()\nif S[-1]==s:\n print(S+"es")\nelse:\n print(S+"s")', 'S=str(input())\nif s[-1]=s:\n print(S+"es")\nelse:\n print(S+"s")', 'S=input()\nif S[-1:]=="s":\n print("S"+"es")\nelse:\n print("S"+"s")', 'S=str(input())\nif S[-1]==s:\n print(S+"es")\nelse:\n print(S+"s")\n', 'S=input()\nif S[-1]==s:\n print("S"+"es")\nelse:\n print("S"+"s")', 'S=str(input())\nif S[-1]==s:\n print(S+"es")\nelse:\n print(S+"s")', 'S=input()\nif S[-1:]=="s":\n print(S+"es")\nelse:\n print(S+"s")']

['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']

['s222975645', 's372437505', 's603605237', 's672265523', 's877823031', 's970085237', 's591374339']

[9096.0, 9004.0, 9084.0, 9076.0, 9080.0, 9028.0, 9088.0]

[28.0, 30.0, 33.0, 24.0, 26.0, 27.0, 34.0]

[63, 67, 70, 69, 67, 68, 66]

p02546

u918712681

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

['N = int(input())\nA=[list(map(int, input().split())) for i in range(N)]\nnum = 0\nzoro = 0\nwhile num < N:\n if A[num][0] ==A[num][1]:\n num +=1\n zoro +=1 \n else:\n num +=1\n if zoro >2:\n zoro = zoro\n else:\n zoro = 0\nif zoro >2 :\n print("Yes")\nelse:\n print("No")', 'N = int(input())\nA=[list(map(int, input().split())) for i in range(N)]\nnum = 0\nzoro = 0\nwhile num < N:\n if A[num][0] ==A[num][1]:\n num +=1\n zoro +=1 \n else:\n num +=1\n if zoro >2:\n zoro = zoro\n else:\n zoro = 0\nif zoro >2 :\n print("Yes")\nelse:\n print("No")', 'text = input()\ntend = len(text)\ntext2 = ""\nif text[len(text)-1:len(text)] == "s":\n text2 = text +\'es\'\nelse:\n text2 = text +\'s\'\nprint(text2) \n']

['Runtime Error', 'Runtime Error', 'Accepted']

['s166494302', 's511059910', 's307572105']

[9184.0, 9088.0, 9080.0]

[31.0, 23.0, 24.0]

[283, 283, 147]

p02546

u923342518

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

["N = int(input())\ncount = 0\nc = 0\nfor i in range(N):\n d1,d2 = input().split()\n if d1==d2:\n count+=1\n if count==3:\n c =1\n sys.exit()\n else:\n count=0\nif c==1:\n print('Yes')\nelse:\n print('No')", "S = input()\nif S[-1]=='s':\n s = S+'s'\nelse:\n s = S+'es'\nprint(s)", "S = input()\nif S=='s':\n s = S+'s'\nelse:\n s = S+'es'\nprint(s)", "N = int(input())\ncount = 0\nc = 0\nfor i in range(N):\n d1,d2 = input().split()\n if d1==d2:\n count+=1\n if count==3:\n c =1\n\n else:\n count=0\nif c==1:\n print('Yes')\nelse:\n print('No')", "N = int(input())\ncount = 0\nc = 0\nfor i in range(N):\n d1,d2 = input().split()\n if d1==d2:\n count+=1\n if count==3:\n c =1\n else:\n count=0\nif count==1:\n print('Yes')\nelse:\n print('No')", "S = input()\nif S[-1]=='s':\n s = S+'es'\nelse:\n s = S+'s'\nprint(s)"]

['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted']

['s190766471', 's369400912', 's532407035', 's580739792', 's595638452', 's587421184']

[9120.0, 9020.0, 9072.0, 9168.0, 9168.0, 9076.0]

[22.0, 32.0, 34.0, 23.0, 24.0, 28.0]

[246, 70, 66, 224, 227, 70]

p02546

u928758473

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

['import os\nimport sys\nfrom collections import defaultdict, Counter\nfrom itertools import product, permutations,combinations, accumulate\nfrom operator import itemgetter\nfrom bisect import bisect_left,bisect\nfrom heapq import heappop,heappush,heapify\nfrom math import ceil, floor, sqrt\nfrom copy import deepcopy\n \n\n\ndef main():\n \ts = input()\n \tif s[-1] == "s":\n print(s + "es")\n \telse:\n print(s + "s")\n\nif __name__ == "__main__":\n main()', 'import os\nimport sys\nfrom collections import defaultdict, Counter\nfrom itertools import product, permutations,combinations, accumulate\nfrom operator import itemgetter\nfrom bisect import bisect_left,bisect\nfrom heapq import heappop,heappush,heapify\nfrom math import ceil, floor, sqrt\nfrom copy import deepcopy\n \n\n\ndef main():\n s = input()\n if s[-1] == "s":\n print(s + "es")\n else:\n print(s + "s")\n\nif __name__ == "__main__":\n main()', 'import os\nimport sys\nfrom collections import defaultdict, Counter\nfrom itertools import product, permutations,combinations, accumulate\nfrom operator import itemgetter\nfrom bisect import bisect_left,bisect\nfrom heapq import heappop,heappush,heapify\nfrom math import ceil, floor, sqrt\nfrom copy import deepcopy\n \n\n\ndef main():\n s = input()\n if s[-1] == "s":\n print(s + "es")\n else:\n print(s + "s")\n\nif __name__ == "__main__":\n main()']

['Runtime Error', 'Runtime Error', 'Accepted']

['s204362339', 's766812230', 's289695528']

[9004.0, 8880.0, 9480.0]

[24.0, 27.0, 37.0]

[456, 455, 457]

p02546

u936988827

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

['line = input()\n\nif line[len(line)] == ("s"):\n line += "es"\nelse:\n line += "s"\nprint(line)', 'line = input()\n \nif line[len(line)-1] == ("s"):\n line += "es"\nelse:\n line += "s"\nprint(line)']

['Runtime Error', 'Accepted']

['s309988739', 's940346032']

[8892.0, 8976.0]

[23.0, 28.0]

[91, 94]

p02546

u945761460

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

['import sys\nreadline = sys.stdin.readline\nsys.setrecursionlimit(10**8)\nmod = 10**9+7\n#mod = 998244353\nINF = 10**18\neps = 10**-7\n\nn,x,m=map(int,input().split())\ns=set()\nl=[]\nflag=False\ncnt=1\nans=0\n\nl.append(x)\nfor i in range(m):\n if x not in s:\n s.add(x)\n x=(x**2)%m\n l.append(x)\n else:\n break\n\nh=len(l)\ncnt=1\nnum=0\nfor i in range(h):\n if l[i]==l[h-1]:\n while l[i+cnt]!=l[h-1]:\n cnt+=1\n flag=True\n break\n else:\n num+=1\n ans+=l[i]\n\nn-=num\nif num!=0:\n del l[h-1]\n del l[0:num]\n\nif n>=len(l):\n mod=n%len(l)\n ans+=sum(l)*(n//len(l))\n for i in range(1,mod):\n ans+=l[i-1]\n print(ans)\nelse:\n for i in range(n):\n ans+=l[i]\n print(ans)', "import sys\nreadline = sys.stdin.readline\nsys.setrecursionlimit(10**8)\nmod = 10**9+7\n#mod = 998244353\nINF = 10**18\neps = 10**-7\ns=str(input())\nif s[len(s)-1]=='s':\n print(s+'es')\nelse:\n print(s+'s')"]

['Runtime Error', 'Accepted']

['s044669759', 's802540529']

[9524.0, 9452.0]

[31.0, 26.0]

[674, 199]

p02546

u953379577

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

['s = list(input())\nif s[-1] == s:\n for i in s:\n print(i,end = "")\n print("es")\nelse:\n for i in s:\n print(i,end = "")\n print("s")', 's = input()\nif s[-1] == "s":print(s+"es")\nelse:print(s+"s")']

['Wrong Answer', 'Accepted']

['s956663221', 's202000676']

[9096.0, 9076.0]

[31.0, 30.0]

[161, 59]

p02546

u953855545

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

['word = input()\n\nif word[-1] == "s":\n print(word + "es")\nelse:\n print(word)', 'word = input()\nif word[-1] == "s":\n print(word + "es)\nelse:\n print(word)\n', 'word = input()\nif word[-1] == "s":\n print(word + "es")\nelse:\n print(word + "s")']

['Wrong Answer', 'Runtime Error', 'Accepted']

['s632140814', 's901468632', 's933534422']

[9020.0, 9004.0, 9088.0]

[30.0, 26.0, 29.0]

[76, 75, 81]

p02546

u956302718

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

['\'\'\'\nName: Devansh\nUsername: singhdevansh\nGithub: https://github.com/Devansh3712\n\'\'\'\n\nimport os\nimport sys\nimport math\nfrom itertools import *\nfrom io import BytesIO, IOBase\nfrom collections import *\n\n#<fast I/O>\nBUFSIZE = 8192\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\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\n#</fast I/O>\n\n#<template>\nmod=(10**9)+7\npi=3.14159265358979323846264338327950\n\ndef i1():\t#int(input())\n\treturn int(sys.stdin.readline())\n\ndef sf():\t#input()\n\treturn sys.stdin.readline()\n\ndef mi():\t#map(int(input()))\n\treturn map(int,sys.stdin.readline().split())\n\ndef arr():\t#list(map(int,input().split()))\n\treturn list(map(int,sys.stdin.readline().split()))\n\ndef pf(ans): #print(x)\n\treturn sys.stdout.write(str(ans)+"\\n")\n\ndef gcd(a,b):\n\tif a==0:\n\t\treturn b\n\telif b==0:\n\t\treturn a\n\tif a>b:\n\t\treturn gcd(a%b,b)\n\telse:\n\t\treturn gcd(a,b%a)\n\ndef lcm(a,b):\n\treturn (a*b)//gcd(a,b)\n#</template>\n\n#<solve>\ndef solve():\n\ts=input()\n\tif s[-1]=\'s\':\n\t\tprint(s+\'es\')\n\telse:\n\t\tprint(s+\'s\')\nsolve()\n#</solve>\n\n#<solution>\n# tc=i1()\n# for t in range (tc):\n# \tsolve()\n#<solution>', '\'\'\'\nName: Devansh\nUsername: singhdevansh\nGithub: https://github.com/Devansh3712\n\'\'\'\n\nimport os\nimport sys\nimport math\nfrom itertools import *\nfrom io import BytesIO, IOBase\nfrom collections import *\n\n#<fast I/O>\nBUFSIZE = 8192\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\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\n#</fast I/O>\n\n#<template>\nmod=(10**9)+7\npi=3.14159265358979323846264338327950\n\ndef i1():\t#int(input())\n\treturn int(sys.stdin.readline())\n\ndef sf():\t#input()\n\treturn sys.stdin.readline()\n\ndef mi():\t#map(int(input()))\n\treturn map(int,sys.stdin.readline().split())\n\ndef arr():\t#list(map(int,input().split()))\n\treturn list(map(int,sys.stdin.readline().split()))\n\ndef pf(ans): #print(x)\n\treturn sys.stdout.write(str(ans)+"\\n")\n\ndef gcd(a,b):\n\tif a==0:\n\t\treturn b\n\telif b==0:\n\t\treturn a\n\tif a>b:\n\t\treturn gcd(a%b,b)\n\telse:\n\t\treturn gcd(a,b%a)\n\ndef lcm(a,b):\n\treturn (a*b)//gcd(a,b)\n#</template>\n\n#<testcases>\n#sys.stdin=open(\'input.txt\',\'r\')\n#sys.stdout=open(\'output.txt\',\'w\')\n#</testcases>\n\n#<solve>\ndef solve():\n\ts=input()\n\tif s[-1]=s:\n\t\tprint(s+\'es\')\n\telse:\n\t\tprint(s+\'s\')\nsolve()\n#</solve>\n\n#<solution>\n# tc=i1()\n# for t in range (tc):\n# \tsolve()\n#<solution>', '\'\'\'\nName: Devansh\nUsername: singhdevansh\nGithub: https://github.com/Devansh3712\n\'\'\'\n\nimport os\nimport sys\nimport math\nfrom itertools import *\nfrom io import BytesIO, IOBase\nfrom collections import *\n\n#<fast I/O>\nBUFSIZE = 8192\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\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\n#</fast I/O>\n\n#<template>\nmod=(10**9)+7\npi=3.14159265358979323846264338327950\n\ndef i1():\t#int(input())\n\treturn int(sys.stdin.readline())\n\ndef sf():\t#input()\n\treturn sys.stdin.readline()\n\ndef mi():\t#map(int(input()))\n\treturn map(int,sys.stdin.readline().split())\n\ndef arr():\t#list(map(int,input().split()))\n\treturn list(map(int,sys.stdin.readline().split()))\n\ndef pf(ans): #print(x)\n\treturn sys.stdout.write(str(ans)+"\\n")\n\ndef gcd(a,b):\n\tif a==0:\n\t\treturn b\n\telif b==0:\n\t\treturn a\n\tif a>b:\n\t\treturn gcd(a%b,b)\n\telse:\n\t\treturn gcd(a,b%a)\n\ndef lcm(a,b):\n\treturn (a*b)//gcd(a,b)\n#</template>\n\n\n#<solve>\ndef solve():\n\ts=input()\n\tif s[-1]==\'s\':\n\t\tprint(s+\'es\')\n\telse:\n\t\tprint(s+\'s\')\nsolve()\n#</solve>\n\n#<solution>\n# tc=i1()\n# for t in range (tc):\n# \tsolve()\n#<solution>']

['Runtime Error', 'Runtime Error', 'Accepted']

['s242534404', 's782153138', 's336193966']

[9188.0, 9192.0, 9496.0]

[29.0, 23.0, 37.0]

[2571, 2665, 2573]

p02546

u956318161

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

['n = int(input())\nimport math\nans = 0\nfor a in range(1, n):\n ans += math.floor((n - 1) / a)\nprint(ans)', 'S=list(input())\nif S[len(S)-1]=="s":\n S.append("es")\nelse:\n S.append("s")\ns="".join(S)\nprint(s)']

['Runtime Error', 'Accepted']

['s841151807', 's688143058']

[9184.0, 9084.0]

[31.0, 32.0]

[102, 97]

p02546

u964635736

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

['a=input()\ne=a[len(a)-1:len(a)-1]\nif e == "s":\n print(a+"es")\nelse:\n print(a+"s"', 'a=input()\ne=a[len(a)-1:len(a)]\nif e == "s":\n print(a+"es")\nelse:\n print(a+"s")']

['Runtime Error', 'Accepted']

['s815105358', 's222242162']

[8992.0, 9084.0]

[26.0, 27.0]

[85, 84]

p02546

u979501743

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

['x=input()\nprint(x+\'s\' if x[len(x)-1]!=s else x[0:len(x)-1]+"es")', 'x=input()\nprint(x+\'s\' if x[len(x)-1]!=\'s\' else x+"es")\n']

['Runtime Error', 'Accepted']

['s935110237', 's571723911']

[9092.0, 9028.0]

[32.0, 27.0]

[64, 55]

p02546

u983181637

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters. In Taknese, the plural form of a noun is spelled based on the following rules: * If a noun's singular form does not end with `s`, append `s` to the end of the singular form. * If a noun's singular form ends with `s`, append `es` to the end of the singular form. You are given the singular form S of a Taknese noun. Output its plural form.

["m = input()\nc = m[-1]\nif c == 's':\n print(m+'es')\nelse:\n print(c+'s')", "m = input()\nc = m[-1]\nif c == 's':\n print(m+'es')\nelse:\n print(m+'s')"]

['Wrong Answer', 'Accepted']

['s202425180', 's412082910']

[8944.0, 9092.0]

[29.0, 25.0]

[71, 71]

p02547

u018808362

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

["N=int(input())\ncounter=0\nflag=0\nfor i in range(N):\n D1, D2=map(int,input().split())\n if D1==D2:\n counter+=1\n else:\n counter=0\n if counter>=3:\n flag=1\n break\nif flag==1:\n print('Yes')\nelse:\n print('No')", "N=int(input())\ncounter=0\nflag=0\nfor i in range(N):\n D1, D2=map(int,input().split())\n if D1==D2:\n counter+=1\n if counter>=3:\n flag=1\n break\n else:\n counter=0\nif flag==1:\n print('Yes')\nelse:\n print('No')"]

['Wrong Answer', 'Accepted']

['s586901002', 's823147756']

[9184.0, 9176.0]

[31.0, 25.0]

[267, 267]

p02547

u022745965

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['N = int(input())\nsub_yes = 0\nmax_yes = 0\nfor i in range(N):\n d1,d2 = map(int,input().split())\n if d1 == d2:\n sub_yes += 1\n else:\n max_yes = sub_yes\n sub_yes = 0\nif max_yes >= 3:\n print("yes")\nelse:\n print("no")', 'N = int(input())\nsub_yes = 0\nmax_yes = 0\nfor i in range(N):\n d1,d2 = map(int,input().split())\n if d1 == d2:\n sub_yes += 1\n else:\n max_yes = sub_yes\n sub_yes = 0\nif sub_yes > max_yes:\n max_yes = sub_yes\nif max_yes >= 3:\n print("yes")\nelse:\n print("no")', 'N = int(input())\nsub_yes = 0\nmax_yes = 0\nfor i in range(N):\n d1,d2 = map(int,input().split())\n if d1 == d2:\n sub_yes += 1\n else:\n if sub_yes > max_yes:\n max_yes = sub_yes\n sub_yes = 0\n\nif sub_yes > max_yes:\n max_yes = sub_yes\nif max_yes >= 3:\n print("yes")\nelse:\n print("no")', 'N = int(input())\nsub_yes = 0\nmax_yes = 0\nfor i in range(N):\n d1,d2 = map(int,input().split())\n if d1 == d2:\n sub_yes += 1\n if sub_yes > max_yes:\n max_yes = sub_yes\n else:\n if sub_yes > max_yes:\n max_yes = sub_yes\n sub_yes = 0\nif max_yes >= 3:\n print("yes")\nelse:\n print("no")', 'N = int(input())\nsub_yes = 0\nmax_yes = 0\nfor i in range(N):\n d1,d2 = map(int,input().split())\n if d1 == d2:\n sub_yes += 1\n else:\n max_yes = sub_yes\n sub_yes = 0\n\nif sub_yes > max_yes:\n max_yes = sub_yes\n# print(max_yes)\n# print(sub_yes)\nif max_yes >= 3:\n print("yes")\nelse:\n print("no")', 'N = int(input())\nsub_yes = 0\nmax_yes = 0\nfor i in range(N):\n d1,d2 = map(int,input().split())\n if d1 == d2:\n sub_yes += 1\n if sub_yes > max_yes:\n max_yes = sub_yes\n else:\n if sub_yes > max_yes:\n max_yes = sub_yes\n sub_yes = 0\nif max_yes >= 3:\n print("Yes")\nelse:\n print("No")']

['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']

['s019416497', 's162840002', 's374154113', 's453116492', 's547064154', 's655578303']

[9172.0, 9112.0, 9180.0, 9188.0, 9184.0, 9084.0]

[24.0, 34.0, 31.0, 28.0, 32.0, 26.0]

[246, 290, 325, 340, 325, 340]

p02547

u032625182

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

["import os,sys\nc=0\n\nn=input()\nfor i range(n):\n m=input()\n one=m[0]\n two=m[2]\n if(one==two):\n c+=1\n \nif(c>=3):\n print('Yes')\nelse:\n print('No')\n", "import os,sys\nc=0\n\nn=input()\nfor i in range(int(n)):\n m=input()\n one=m[0]\n two=m[2]\n if(one==two):\n c+=1\n else:\n c=0\n \nif(c>=3):\n print('Yes')\nelse:\n print('No')\n", "import os,sys\nc=0\nok=False\nn=input()\nfor i in range(int(n)):\n m=input()\n one=m[0]\n two=m[2]\n if one==two:\n c+=1\n else:\n c=0\n if c>=3:\n ok=True\n \nif(ok):\n print('Yes')\nelse:\n print('No')\n"]

['Runtime Error', 'Wrong Answer', 'Accepted']

['s347934666', 's600430137', 's963605758']

[9000.0, 9172.0, 9088.0]

[29.0, 31.0, 33.0]

[170, 200, 234]

p02547

u034194513

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['n = int(input())\nl = [list(map(int, input().split())) for i in range(n)]\n#print(l[0][0])\n#print(l[0][1])\nans = n-2\nans1 = 0\n\nfor m in range(ans):\n if l[m][0] == l[m][1] and l[m+1][0] == l[m+1][1] and l[m+2][0] == l[m+2][1]:\n ans1 += 1\n else:\n ans1 = 0\n \n \nif ans1 >= 1:\n print("Yes")\nelse:\n print("No")', 'n = int(input())\nl = [list(map(int, input().split())) for i in range(n)]\n#print(l[0][0])\n#print(l[0][1])\nans = n-2\nans1 = 0\n\nfor m in range(ans):\n if l[m][0] == l[m][1] and l[m+1][0] == l[m+1][1] and l[m+2][0] == l[m+2][1]:\n ans1 += 1\n else:\n ans1 = 0\n \n \nif ans1 >= 1:\n print("Yes")\nelse:\n print("No")', 'n = int(input())\nl = [list(map(int, input().split())) for i in range(n)]\n#print(l[0][0])\n#print(l[0][1])\nans = n-2\nans1 = 0\n\nfor m in range(ans):\n if l[m][0] == l[m][1] and l[m+1][0] == l[m+1][1] and l[m+2][0] == l[m+2][1]:\n ans1 += 1\n \n \n \nif ans1 >= 1:\n print("Yes")\nelse:\n print("No")']

['Wrong Answer', 'Wrong Answer', 'Accepted']

['s204246470', 's977832485', 's451623866']

[9160.0, 9116.0, 8980.0]

[30.0, 33.0, 33.0]

[319, 319, 300]

p02547

u035453792

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['n = int(input())\ncnt=0\nfor _ in range(n):\n a,b=map(int,input()split())\n if a==b:\n cnt+=1\n if cnt>=3:\n break\n else:\n cnt=0\nif cnt>=3:\n print("Yes")\nelse:\n print("No")', 'n = int(input())\ncnt=0\nfor _ in range(n):\n a,b=map(int,input().split())\n if a==b:\n cnt+=1\n if cnt>=3:\n break\n else:\n cnt=0\nif cnt>=3:\n print("Yes")\nelse:\n print("No")']

['Runtime Error', 'Accepted']

['s770095524', 's057482407']

[9004.0, 9024.0]

[28.0, 28.0]

[212, 213]

p02547

u050103839

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

["i = input()\nidx = 0\n\nwhile idx < i:\n \tcnt = 0\n\tfor _ in range(3):\n d1, d2 = list(map(int, input.split(' ')))\n if d1 == d2:\n cnt += 1\n if cnt == 3:\n print('Yes')\n else:\n idx += 1\n\nprint('No')", "N = input()\nlst = []\nfor _ in range(N):\n d1, d2 = map(int, input.split(' '))\n lst.append((d1, d2))\n \nidx = 0\nwhile idx < N-3:\n cnt = 0\n for _ in range(3):\n d1, d2 = lst[idx]\n if d1 == d2:\n cnt += 1\n \n if cnt == 3:\n print('Yes')\n break\n else:\n idx += 1\nprint('No')", "\nCopy\nCopy\nN = int(input())\nlst = []\nfor _ in range(N):\n d1, d2 = map(int, input().split(' '))\n lst.append((d1, d2))\n \nidx = 0\nwhile idx < N-3:\n cnt = 0\n for _ in range(3):\n d1, d2 = lst[idx]\n if d1 == d2:\n cnt += 1\n \n if cnt == 3:\n print('Yes')\n break\n else:\n idx += 1\nprint('No')", "i = input()\nidx = 0\n\nwhile idx < i:\n \tcnt = 0\n\tfor _ in range(3):\n d1, d2 = list(map(int, input.split(' ')))\n if d1 == d2:\n cnt += 1\n if cnt == 3:\n return 'Yes'\n else:\n idx += 3\n\nprint('No')", "N = input()\n\nidx = 0\nwhile idx < N-3:\n cnt = 0\n for _ in range(3):\n d1, d2 = map(int, input.split(' '))\n if d1 == d2:\n cnt += 1\n \n if cnt == 3:\n print('Yes')\n break\n else:\n idx += 1\nprint('No')", "N = int(input())\nlst = []\nfor _ in range(N):\n d1, d2 = map(int, input.split(' '))\n lst.append((d1, d2))\n \nidx = 0\nwhile idx < N-3:\n cnt = 0\n for _ in range(3):\n d1, d2 = lst[idx]\n if d1 == d2:\n cnt += 1\n \n if cnt == 3:\n print('Yes')\n break\n else:\n idx += 1\nprint('No')", "N = int(input())\nlst = []\nfor _ in range(N):\n d1, d2 = map(int, input().split(' '))\n lst.append((d1, d2))\n \nidx = 0\nflag = False\nwhile idx < N-2:\n cnt = 0\n for i in range(3):\n d1, d2 = lst[i+idx]\n if d1 == d2:\n cnt += 1\n if cnt == 3:\n flag = True\n break\n else:\n idx += 1\n \nprint('Yes' if flag else 'No')"]

['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']

['s109840446', 's143894237', 's584509244', 's678131774', 's893844714', 's983780564', 's367498014']

[9016.0, 9136.0, 9124.0, 9004.0, 9088.0, 9204.0, 9080.0]

[31.0, 27.0, 26.0, 27.0, 22.0, 25.0, 28.0]

[224, 291, 309, 224, 218, 296, 330]

p02547

u050663669

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['n = int(input())\na = [input().split(" ") for i in range(n)]\nnum = 0\nnummax = 0\nfor i in range(n):\n print(a[i][0])\n if int(a[i][0])==int(a[i][1]):\n num+=1\n else:\n if num> nummax:\n nummax = num\n num=0\nif nummax>3:\n print(\'Yes\')\nelse:\n print(\'No\')', 'n = int(input())\na = [input().split(" ") for i in range(n)]\nnum = 0\nnummax = 0\nfor i in range(n):\n if int(a[i][0])==int(a[i][1]):\n num+=1\n else:\n if num> nummax:\n nummax = num\n num=0\nif num> nummax:\n nummax = num\nif nummax>=3:\n print(\'Yes\')\nelse:\n print(\'No\')']

['Wrong Answer', 'Accepted']

['s432728182', 's192675137']

[9188.0, 9192.0]

[31.0, 34.0]

[265, 279]

p02547

u054471580

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['n=input()\n\nc=0\nflag=0\nfor i in range(n):\n a,b = map(int(),input().split())\n if(a==b):\n c+=1\n else:\n c=0\n if(c==3):\n print("Yes")\n flag=1\n break\nif(flag==0):\n print("No")', 'n=input()\n\nc=0\nflag=0\nfor i in range(n):\n a,b = map(int,input().split())\n if(a==b):\n c+=1\n else:\n c=0\n if(c==3):\n print("Yes")\n flag=1\n break\nif(flag==0):\n print("No")', 'n=int(input())\n\nc=0\nflag=0\nfor i in range(n):\n a,b = map(int,input().split())\n if(a==b):\n c+=1\n else:\n c=0\n if(c==3):\n print("Yes")\n flag=1\n break\nif(flag==0):\n print("No")']

['Runtime Error', 'Runtime Error', 'Accepted']

['s000345555', 's217908966', 's098734693']

[8952.0, 9112.0, 9180.0]

[25.0, 21.0, 31.0]

[189, 187, 192]

p02547

u054825571

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['N=int(input())\np=False\ns=0\nfor i in range(N):\n a,b=map(int,input().split())\n if a==b:\n s+=1\n if s==3:\n break\n else:\n s=0\nprint("Yes" if p else "No")', 'N=int(input())\np=False\ns=0\nfor i in range(N):\n a,b=map(int,input().split())\n if a==b:\n s+=1\n if s==3:\n p=True\n break\n else:\n s=0\nprint("Yes" if p else "No")\n']

['Wrong Answer', 'Accepted']

['s295302580', 's092482602']

[9168.0, 9184.0]

[32.0, 32.0]

[165, 179]

p02547

u060505280

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

["N = int(input())\ncnt = 0\nans = False\nfor i in range(N):\n a, b = input().split()\n print(a, b)\n if a == b:\n cnt += 1\n else:\n cnt = 0\n if cnt == 3:\n ans True\n break\n print(cnt)\nprint('Yes' if ans else 'No')\n\n", "N = int(input())\ncnt = 0\nans = False\nfor i in range(N):\n a, b = input().split()\n if a == b:\n cnt += 1\n else:\n cnt = 0\n if cnt == 3:\n ans = True\n break\nprint('Yes' if ans else 'No')\n\n"]

['Runtime Error', 'Accepted']

['s418009639', 's093947531']

[8888.0, 9160.0]

[25.0, 34.0]

[251, 222]

p02547

u061835391

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

["n=int(input())\nl=[]\nm=[]\nfor i in range(0,n):\n a,b=map(int,input().split())\n l.append(a)\n m.append(b)\nc=0\ni=0\nwhile i<=n-3:\n if l[i]==m[i] and l[i+1]==m[i+1] and l[i+2]==m[i+2]:\n c=3\n i=i+2\nif c==3:\n print('Yes')\nelse:\n print('No')\n", "n=int(input())\nl=[]\nm=[]\nfor i in range(0,n):\n a,b=map(int,input().split())\n l.append(a)\n m.append(b)\nc=0\nfor i in range(0,n):\n if l[i]==m[i]:\n c=c+1\n else:\n c=0\nif c==3:\n print('Yes')\nelse:\n print('No')", "n=int(input())\nl=[]\nm=[]\nfor i in range(0,n):\n a,b=map(int,input().split())\n l.append(a)\n m.append(b)\nc=0\ni=0\nwhile i<=n-3:\n if l[i]==m[i] and l[i+1]==m[i+1] and l[i+2]==m[i+2]:\n c=3\n i=i+1\nif c==3:\n print('Yes')\nelse:\n print('No')\n"]

['Wrong Answer', 'Wrong Answer', 'Accepted']

['s092390500', 's451575346', 's618752036']

[9020.0, 9192.0, 9096.0]

[26.0, 29.0, 28.0]

[244, 216, 244]

p02547

u070257479

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

["n=int(input())\nc=0\nfor i in range(n):\n a,b=[(int x) for x in input().split()]\n if a==b:\n c+=1\nif c>=3:\n print('Yes')\nelse:\n print('No')", 'import sys, os, io\ndef rs(): return sys.stdin.readline().rstrip()\ndef ri(): return int(sys.stdin.readline())\ndef ria(): return list(map(int, sys.stdin.readline().split()))\ndef ws(s): sys.stdout.write(s + \'\\n\')\ndef wi(n): sys.stdout.write(str(n) + \'\\n\')\ndef wia(a): sys.stdout.write(\' \'.join([str(x) for x in a]) + \'\\n\')\nimport math,datetime,functools,itertools,operator,bisect,fractions\nfrom collections import deque,defaultdict,OrderedDict,Counter\nfrom fractions import Fraction\nfrom decimal import Decimal\n \ndef main():\n starttime=datetime.datetime.now()\n if(os.path.exists(\'input.txt\')):\n sys.stdin = open("input.txt","r")\n sys.stdout = open("output.txt","w")\n \n for _ in range(1):\n n=ri()\n c=0\n z=0\n for i in range(n):\n a,b=ria()\n if a==b:\n c+=1\n else:\n c=0\n z=max(z,c)\n if z>=3:\n print(\'Yes\')\n else:\n print(\'No\')\n \n \n \n \n \n \n \n \n #<--Solving Area Ends\n endtime=datetime.datetime.now()\n time=(endtime-starttime).total_seconds()*1000\n if(os.path.exists(\'input.txt\')):\n print("Time:",time,"ms") \n \n \nclass FastReader(io.IOBase):\n newlines = 0\n\n def __init__(self, fd, chunk_size=1024 * 8):\n self._fd = fd\n self._chunk_size = chunk_size\n self.buffer = io.BytesIO()\n\n def read(self):\n while True:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, self._chunk_size))\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, size=-1):\n while self.newlines == 0:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, self._chunk_size if size == -1 else size))\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\nclass FastWriter(io.IOBase):\n\n def __init__(self, fd):\n self._fd = fd\n self.buffer = io.BytesIO()\n self.write = self.buffer.write\n\n def flush(self):\n os.write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\n\n\nclass FastStdin(io.IOBase):\n def __init__(self, fd=0):\n self.buffer = FastReader(fd)\n self.read = lambda: self.buffer.read().decode("ascii")\n self.readline = lambda: self.buffer.readline().decode("ascii")\n\n\nclass FastStdout(io.IOBase):\n def __init__(self, fd=1):\n self.buffer = FastWriter(fd)\n self.write = lambda s: self.buffer.write(s.encode("ascii"))\n self.flush = self.buffer.flush\n\n\nif __name__ == \'__main__\':\n sys.stdin = FastStdin()\n sys.stdout = FastStdout()\n main()\n\n\n\n\n\n']

['Runtime Error', 'Accepted']

['s611207506', 's857352595']

[8948.0, 10480.0]

[28.0, 45.0]

[142, 3038]

p02547

u071773067

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['n = int(input())\nflag= True\ncount = 0\nfor i in range(n):\n a,b = list(map(int, input().split()))\n if a==b:\n count += 1\n else:\n count= 0\n if count==3:\n flag = True\nif flag:\n print("yes")\nelse:\n print("No")\n ', 'n = int(input())\nflag= True\ncount = 0\nfor i in range(n):\n a,b = list(map(int, input().split()))\n if a==b:\n count += 1\n else:\n count= 0\n if count==3:\n flag = True\nif flag:\n print("yes")\nelse:\n print("no")', 'n = int(input())\n\ncount = 0\nfor i in range(n):\n a,b = list(map(int, input().split()))\n print(a,b)', 'n = int(input())\nflag= False\ncount = 0\nfor i in range(n):\n a,b = list(map(int, input().split()))\n if a==b:\n count += 1\n else:\n count= 0\n if count==3:\n flag = True\nif flag:\n print("Yes")\nelse:\n print("No")']

['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']

['s141893624', 's198039293', 's375194538', 's137109647']

[9160.0, 9176.0, 9160.0, 9044.0]

[41.0, 26.0, 32.0, 30.0]

[220, 218, 99, 219]

p02547

u075317232

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

["def ProgramB():\n \n num = int(input())\n \n before = 'No'\n count = 0\n max_count = 0\n\n for i in range(num):\n data = list(map(int,input().split()))\n\n if num == 0:\n\n if data[0] == data[1]:\n before = 'Yes'\n count = count + 1\n \n if count > max_count:\n max_count = count\n \n else:\n before = 'No'\n count = 0\n\n else:\n if data[0] == data[1] and before == 'Yes':\n before = 'Yes'\n count = count + 1\n \n if count > max_count:\n max_count = count\n \n else:\n before = 'No'\n count = 0\n \n \n if max_count >= 3: \n print('Yes')\n \n else:\n print('No')\n \n \nif __name__ == '__main__':\n ProgramB()\n\n", "def ProgramB():\n \n num = int(input())\n \n count = 0\n max_count = 0\n\n for i in range(num):\n data = list(map(int,input().split()))\n\n if num == 0:\n\n if data[0] == data[1]:\n count = count + 1\n \n if count > max_count:\n max_count = count\n \n else:\n count = 0\n\n else:\n if data[0] == data[1]:\n count = count + 1\n \n if count > max_count:\n max_count = count\n \n else:\n count = 0\n \n \n if max_count >= 3: \n print('Yes')\n \n else:\n print('No')\n \n \nif __name__ == '__main__':\n ProgramB()\n\n"]

['Wrong Answer', 'Accepted']

['s323731133', 's254830328']

[9196.0, 9188.0]

[31.0, 26.0]

[951, 791]

p02547

u077948085

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

["i = int(input())\ncount = 0\nfor i in range(i):\n a, b = input().split(' ')\n if a == b:\n count += 1\nprint('Yes' if count >= 3 else 'No'\n", "i = int(input())\ncount = 0\nfor i in range(i):\n a, b = input().split(' ')\n if a == b:\n count += 1\n else:\n count = 0\nprint('Yes' if count >= 3 else 'No')\n", "i = int(input())\ncount = 0\nres = False\nfor i in range(i):\n a, b = input().split(' ')\n if a == b:\n count += 1\n else:\n count = 0\n if count >= 3:\n res = True\nprint('Yes' if res else 'No')\n"]

['Runtime Error', 'Wrong Answer', 'Accepted']

['s130229687', 's814760795', 's107112347']

[9016.0, 9152.0, 9164.0]

[26.0, 30.0, 33.0]

[138, 161, 198]

p02547

u087590461

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

["N = int(input())\ncount=0\nfor i in range(N):\n p,q=map(int,input().split(' '))\n if count<3:\n\tif p==q:\n count+=1\n else:\n count=0\n else:\n pass\nif count>=3:\n print('Yes')\nelse:\n print('No')", "N= int(input())\ncount=0\nfor i in range(N):\n p,q=map(int,input().split(' '))\n if p==q:\n count+=1\n\telse:\n count=0\n\nif count>=3:\n print('Yes')\nelse:\n print('No')\n\t\t\n", "N= int(input())\ncount=0\nfor i in range(N):\n\tp,q=list(map(int,input().split(' ')))\n if p==q:\n\t\tcount+=1\n\telse:\n \tcount=0\n\nif count>=3:\n print('Yes')\nelse:\n print('No')\n\t\t\n", "N= int(input())\ncount=0\nfor i in range(N):\n\tp,q=map(int,input().split(' '))\n if p==q:\n\t\tcount+=1\n\telse:\n \tcount=0\n\nif count>=3:\n print('Yes')\nelse:\n print('No')\n\t\t", "N= int(input())\ncount=0\nfor i in range(N):\n p,q=map(int,input().split(' '))\n if count<3:\n if p==q:\n count+=1\n else:\n count=0\n else:\n pass\n\nif count>=3:\n print('Yes')\nelse:\n print('No')"]

['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']

['s231152509', 's329915367', 's468772613', 's816939799', 's001519979']

[9000.0, 8980.0, 9012.0, 9016.0, 9204.0]

[30.0, 24.0, 21.0, 30.0, 27.0]

[205, 172, 180, 173, 208]

p02547

u092061507

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

["N = int(input())\nD = [map(int, input().split()) for i in range(N)]\n\nseq = 0\nfor i in range(len(D)):\n if D[i][0] == D[i][1]:\n if D[i+1][0] == D[i+1][1]:\n if D[i+2][0] == D[i+2][1]:\n print('Yes')\n exit()\n\nprint('No')\n", "N = int(input())\nD = [list(map(int, input().split())) for i in range(N)]\n\nseq = 0\nfor i in range(len(D)-2):\n if D[i][0] == D[i][1]:\n if D[i+1][0] == D[i+1][1]:\n if D[i+2][0] == D[i+2][1]:\n print('Yes')\n exit()\nprint('No')\n"]

['Runtime Error', 'Accepted']

['s735585649', 's299595165']

[9196.0, 9192.0]

[31.0, 33.0]

[266, 273]

p02547

u093838453

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['n = int(input())\ncount=0\n\nfor num in range(n):\n d1,d2 = map(int,input().split())\n if d1 == d2:\n count += 1\nelse:\n if count>0:\n print("Yes")\n else:\n print("No")v', 'n = int(input())\ncount=0\nflg=0\n\nfor num in range(n):\n d1,d2 = map(int,input().split())\n if d1 == d2:\n count += 1\n if count>= 3:\n flg = 1\n\n else:\n count=0\nelse:\n if count > 3 | flg >0:\n print("Yes")\n else:\n print("No")\n ', 'n = int(input())\ncount=0\nflg=0\n\nfor num in range(n):\n d1,d2 = map(int,input().split())\n if d1 == d2:\n count += 1\n if count>= 3:\n flg = 1\n else:\n count=0\nelse:\n if count > 3 or flg >0:\n print("Yes")\n else:\n print("No")']

['Runtime Error', 'Wrong Answer', 'Accepted']

['s553692028', 's722701210', 's365322116']

[9032.0, 9188.0, 9156.0]

[26.0, 29.0, 29.0]

[193, 287, 278]

p02547

u105226136

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['n = int(input())\n\nd12 = [map(int, input().split()) for _ in range(n)]\nd1, d2 = [list(i) for i in zip(*d12)]\n\nfor i in range(n-2):\n if d1[i] == d2[i]:\n if d1[i+1] == d2[i+1]:\n if d1[i+2] == d2[i+2]:\n print("YES")\n break\nelse:\n print("NO")', 'n = int(input())\n\nd12 = [map(int, input().split()) for _ in range(n)]\nd1, d2 = [list(i) for i in zip(*d12)]\n\nfor i in range(n-2):\n if d1[i] == d2[i]:\n if d1[i+1] == d2[i+1]:\n if d1[i+2] == d2[i+2]:\n print("Yes")\n break\nelse:\n print("No")']

['Wrong Answer', 'Accepted']

['s572678117', 's247648814']

[9204.0, 9192.0]

[33.0, 29.0]

[261, 261]

p02547

u106778233

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['n = input() \ntemp = 0\nfor i in range(n):\n d,w = map(int,input().split())\n if d==w:\n temp += 1 \n if temp == 3 :\n print("Yes")\n exit()\n else:\n temp = 0 \n \nprint("No")\n \n ', 'n = int(input()) \ntemp = 0\nfor i in range(n):\n d,w = map(int,input().split())\n if d==w:\n temp += 1 \n if temp == 3 :\n print("Yes")\n exit()\n else:\n temp = 0 \n \nprint("No")']

['Runtime Error', 'Accepted']

['s593452277', 's008064627']

[9032.0, 9168.0]

[32.0, 27.0]

[199, 194]

p02547

u123745130

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['#include <algorithm>\n#include<bits/stdc++.h>\n\n#include <string>\nusing namespace std;\n\nint main(){\n int n,a,b;\n int cnt=0;\n cin>>n;\n \n for(int i=0;i<n;i++){\n cin>>a>>b;\n if(a==b){\n cnt++;\n }else{\n cnt=0;\n }\n if(cnt==3){\n cout<<"Yes"<<endl;\n return 0;\n }\n \n }\n cout<<"No"<<endl;\n return 0;\n}\n', 'n=int(input())\nlst=[list(map(int,input().split())) for _ in range(n)]\n# print(lst)\ncnt=0\nans="No"\nfor i in range(n):\n a,b=lst[i]\n # print(a,b)\n if a==b:\n cnt+=1\n else:\n cnt=0\n if cnt==3:\n # print(a,b,cnt)\n ans="Yes"\n break\n\nprint(ans)']

['Runtime Error', 'Accepted']

['s052225643', 's142668057']

[8852.0, 9176.0]

[24.0, 25.0]

[562, 284]

p02547

u135642682

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['n = int(input())\nd = [input().split(" ") for _ in range(n)]\n\nf = False\nfor i in range(n-2):\n if d[i][0] == d[i][1] and not f :\n print(d[i+1], d[i+2])\n if d[i+1][0] == d[i+1][1] and d[i+2][0] == d[i+2][1]:\n f = True\nif f:\n print("Yes")\nelse:\n print("No")', 'n = int(input())\nd = [input().split(" ") for _ in range(n)]\n\nfor i in range(n-2):\n if d[i][0] == d[i][1]:\n if d[i+1][0] == d[i][1] and d[i+2][0] == d[i+2][1]:\n print("Yes")\nprint("No")', 'n = int(input())\nd = [input().split(" ") for _ in range(n)]\n\nf = False\nfor i in range(n-2):\n if d[i][0] == d[i][1] and not f :\n if d[i+1][0] == d[i+1][1] and d[i+2][0] == d[i+2][1]:\n f = True\nif f:\n print("Yes")\nelse:\n print("No")']

['Wrong Answer', 'Wrong Answer', 'Accepted']

['s208210467', 's658950978', 's366685504']

[9196.0, 9120.0, 9192.0]

[28.0, 31.0, 32.0]

[287, 205, 257]

p02547

u153823221

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['n = int(input())\np = [list(map(int,input().split())) for i in range(n)]\n \n \na = p[0]\nb = 0\nans = 0\ntf = 1\n \nfor j in range(n):\n if sum(p[j]) // 2 ** 2 == sum(p[j]):\n ans += 1\n else:\n ans = 0\n if ans == 3:\n tf = 0\n print("Yes")\n break\n \nif tf == 1:\n print("No")', 'n = int(input())\np = [list(map(int, input().split())) for i in range(n)]\n\nans = 0\nck = 0\n\nfor i in range(n):\n if p[i][0] == p[i][1]:\n ans += 1\n if ans == 3:\n ck = 1\n print("Yes")\n break\n else:\n ans = 0\n \nif ck == 0:\n print("No")']

['Wrong Answer', 'Accepted']

['s633149938', 's699870936']

[9104.0, 9064.0]

[28.0, 29.0]

[283, 258]

p02547

u163971674

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['n=int(input())\ng=0\nfor i in range(n):\n a,b=map(int,input().split(" "))\n if a==b:\n g=g+1\n if g==3:\n break\n break\n else:\n g=0\nprint(g)\nif g==3:\n print("Yes")\nelse:\n print("No")', 'n=int(input())\ng=0\nfor i in range(n):\n a,b=map(int,input().split(" "))\n if a==b:\n g=g+1\n if g==3:\n break\n break\n else:\n g=0\n\n\nif g==3:\n print("Yes")\nelse:\n print("No")']

['Wrong Answer', 'Accepted']

['s349923101', 's956520074']

[9180.0, 9192.0]

[32.0, 29.0]

[198, 191]

p02547

u167908302

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

["# coding:utf-8\nn = int(input())\ncount = 0\n\nfor i in range(n):\n d1, d2 = map(int, input().split())\n\n if d1 == d2:\n count += 1\n\n if count == 3:\n print('Yes')\n exit()\n else:\n count = 0\n\nprint('No')\n", "# coding:utf-8\nn = int(input())\ncount = 0\n\nfor i in range(n):\n d1, d2 = map(int, input().split())\n\n if d1 == d2:\n count += 1\n else:\n count = 0\n\n if count == 3:\n print('Yes')\n exit()\n\n\nprint('No')\n"]

['Wrong Answer', 'Accepted']

['s077435854', 's426478301']

[9152.0, 9152.0]

[28.0, 24.0]

[235, 236]

p02547

u167993508

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['n = int(input())\nl = []\nt = 1\nfor _ in range(n):\n x = list(map(int,input().split())\n l.append(x)\ncount = 0\nfor i, j in l:\n if i == j:\n count += 1\n if i!=j:\n count = 0\n if count == 3:\n \tt = 0\n print("Yes")\n break\nif t:\n print("No")\n ', 'n = int(input())\ncount = 0\nt = 1\nfor _ in range(n):\n a, b = map(int,input().split())\n if a==b:\n count += 1\n if a!=b:\n count = 0\n if count == 3:\n t = 0\nif t:\n print("No")\nelse:\n print("Yes")']

['Runtime Error', 'Accepted']

['s079032806', 's752910690']

[8860.0, 9008.0]

[23.0, 30.0]

[252, 204]

p02547

u171460096

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['import sys\na = []\nfor l in sys.stdin:\n a.append(l)\n\nn = int(a[0])\nIs = []\nfor i in range(n):\n Ds = list(map(int, a[i+1].split()))\n if Ds[0] == Ds[1]:\n Is.append(i)\n\nBoooo = False\nfor i in range(len(Is)-2):\n if Is[i] == Is[i+1] and Is[i+1] == Is[i+2]:\n Boooo = True\n\nif Boooo:\n print("Yes")\nelse:\n print("No")\n\n', 'import sys\na = []\nfor l in sys.stdin:\n a.append(int(l))\nn = a[0]\nIs = []\nfor i in range(n):\n Ds = list(map(int, a[i+1].split()))\n if Ds[0] == Ds[1]:\n Is.append(i)\n\nBoooo = False\nfor i in range(len(Is)-2):\n if Is[i] == Is[i+1] and Is[i+1] == Is[i+2]:\n Boooo = True\n\nif Boooo:\n print("Yes")\nelse:\n print("No")\n\n', 'N= int(input())\na = [input().split() for i in range(N)]\n\nIs = []\nfor i in range(N):\n Ds = a[i]\n if Ds[0] == Ds[1]:\n Is.append(i)\n\nBoooo = False\nfor i in range(len(Is)-2):\n if Is[i] == Is[i+1] and Is[i+1] == Is[i+2]:\n Boooo = True\n\nif Boooo:\n print("Yes")\nelse:\n print("No")\n\n', 'N= int(input())\na = [input().split() for i in range(N)]\n\nn = int(a[0])\nIs = []\nfor i in range(N):\n Ds = list(map(int, a[i].split()))\n if Ds[0] == Ds[1]:\n Is.append(i)\n\nBoooo = False\nfor i in range(len(Is)-2):\n if Is[i] == Is[i+1] and Is[i+1] == Is[i+2]:\n Boooo = True\n\nif Boooo:\n print("Yes")\nelse:\n print("No")\n\n', 'N= int(input())\na = [input().split() for i in range(N)]\n\nIs = []\nfor i in range(N):\n Ds = a[i]\n if Ds[0] == Ds[1]:\n Is.append(i)\n\nBoooo = False\nfor i in range(len(Is)-2):\n if Is[i]+1 == Is[i+1] and Is[i+1]+1 == Is[i+2]:\n Boooo = True\n\nif Boooo:\n print("Yes")\nelse:\n print("No")\n\n']

['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted']

['s026449029', 's355244535', 's688689438', 's771299442', 's781233736']

[9160.0, 9128.0, 9064.0, 9112.0, 9192.0]

[32.0, 25.0, 26.0, 23.0, 25.0]

[342, 341, 304, 342, 308]

p02547

u173925978

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

["n = int(input())\nds1 = []\nds2 = []\nfor _ in range(n):\n d1,d2 = list(map(int, input().split()))\n ds1.append(d1)\n ds2.append(d2)\n\nmatched = [d1 == d2 for d1,d2 in zip(ds1,ds2)]\ncnt = 0\nfor m in matched:\n cnt = cnt+1 if m else 0\n if m == 3:\n break\n\nif cnt == 3:\n print('Yes')\nelse:\n print('No')", "n = int(input())\nds1 = []\nds2 = []\nfor _ in range(n):\n d1,d2 = list(map(int, input().split()))\n ds1.append(d1)\n ds2.append(d2)\n\nmatched = [d1 == d2 for d1,d2 in zip(ds1,ds2)]\ncnt = 0\nfor m in matched:\n cnt = cnt+1 if m else 0\n if cnt == 3:\n break\n\nif cnt == 3:\n print('Yes')\nelse:\n print('No')"]

['Wrong Answer', 'Accepted']

['s867962467', 's635237911']

[9212.0, 9160.0]

[27.0, 31.0]

[319, 321]

p02547

u178788290

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

["N=int(input())\nD={}\nfor i in range(N):\n D=[input().split()]\n\ncou=0\nfor i in range(N):\n if D[i][0]==D[i][1]:\n cou+=1\n else:\n cou=0\n \n if cou == 3:\n print('Yes')\n break\n\nif cou == 0:\n print('No')\n", "N=int(input())\nD={}\nfor i in range(N):\n D[i]=input().split()\n\ncou=0\nfor i in range(N):\n if D[i][0]==D[i][1]:\n cou+=1\n else:\n cou=0\n\n\nif cou >= 3:\n print('Yes')\nelif cou == 0:\n print('No')", "N=int(input())\nD={}\nfor i in range(N):\n D=[input().split()]\n for w in range(2):\n D[i][w]=int(D[i][w])\n\ncou=0\nfor i in range(N):\n if D[i][0]==D[i][1]:\n cou+=1\n else:\n cou=0\n \n if cou == 3:\n print('Yes')\n break\n\nif cou == 0:\n print('No')\n ", "N=int(input())\nD={}\nfor i in range(N):\n D[i]=[input().split()]\n\ncou=0\nfor i in range(N):\n if D[i][0]==D[i][1]:\n cou+=1\n else:\n cou=0\n if cou == 3:\n print('Yes')\n break\n\nif cou == 0:\n print('No')\n", "N=int(input())\nD={}\nfor i in range(N):\n D[i]=input().split()\n\ncou=0\nfor i in range(N):\n if D[i][0]==D[i][1]:\n cou+=1\n if cou ==3:\n print('Yes')\n break\n else:\n cou=0\n\nif cou < 3:\n print('No')"]

['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted']

['s192065998', 's277305779', 's301072269', 's518030446', 's838426960']

[9112.0, 9180.0, 9184.0, 9168.0, 9188.0]

[24.0, 28.0, 25.0, 24.0, 29.0]

[240, 216, 296, 238, 245]

p02547

u197610362

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

["n = int(input())\n\ncnt = 0\nfor i in range(n):\n d1, d2 = input().split()\n if d1 == d2:\n cnt += 1\n else:\n cnt = 0\n if cnt == 3:\n print('Yes')\n break\nprint('No')", "import sys\n\nn = int(input())\n\ncnt = 0\nfor i in range(n):\n d1, d2 = input().split()\n if d1 == d2:\n cnt += 1\n else:\n cnt = 0\n if cnt == 3:\n print('Yes')\n sys.exit()\nprint('No')\n"]

['Wrong Answer', 'Accepted']

['s803043380', 's471903142']

[9164.0, 9160.0]

[35.0, 33.0]

[197, 215]

p02547

u202503015

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['n =int(input())\nfirst =[]\nsecond =[]\nfor i in range(n):\n d1 , d2 = map(int , input().split())\n first.append(d1)\n second.append(d2)\n\nfor i in range(n-2):\n count = 0\n for j in range(i ,i+3):\n if first[j]==second[j]:\n count +=1\n \n if count ==3:\n print("YES")\n break\nelse:\n print("NO")', 'n =int(input())\nfirst =[]\nsecond =[]\nfor i in range(n):\n d1 , d2 = map(int , input().split())\n first.append(d1)\n second.append(d2)\n\nfor i in range(n-2):\n count = 0\n for j in range(i ,i+3):\n if first[j]==second[j]:\n count +=1\n else:\n break\n \n if count ==3:\n print("Yes")\n break\nelse:\n print("No")\n']

['Wrong Answer', 'Accepted']

['s105483027', 's665375481']

[9192.0, 9088.0]

[28.0, 28.0]

[345, 378]

p02547

u207363774

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['N = int(input())\ncount = 0\nfor i in range(N):\n a,b = map(int,input().sprit())\n if a == b:\n count+=1\n if count = 3:\n print("Yes")\n break\n else:\n count = 0\nprint("No")', 'N = int(input())\ncount = 0\nfor i in range(N):\n a,b = map(int,input().split())\n if a == b:\n count+=1\n if count == 3:\n print("Yes")\n break\n else:\n count = 0\nelse:\n print("No")\n']

['Runtime Error', 'Accepted']

['s485805310', 's642688985']

[9028.0, 9184.0]

[24.0, 34.0]

[187, 197]

p02547

u224392054

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['import math\n\nfrom fractions import Fraction as frac\n\nMOD = 1e9 + 7\n\ndef gcd(a, b):\n\n if b == 0:\n\n return a\n\n return gcd(b, a % b)\n\ndef lcm(a, b):\n\n return a * b // gcd(a, b)\n\ndef solve(case_no):\n\n n = int(input())\n\n cnt=0\n\n for i in range(n):\n\n \ta,b = map(int,input().split()) \tif a==b:\n\n cnt += 1\n\n if cnt == 3:\n\n \t\tprint("Yes")\n\n \t\texit()\n\n \telse:\n\n \t\tcnt=0\n\n print("No")\n\nt = 1\n\n# t = int(input())\n\nfor i in range(1, t + 1):\n\n solve(i)', 'import math\nfrom fractions import Fraction as frac\n\nMOD = 1e9 + 7\n\ndef gcd(a, b):\n if b == 0:\n return a\n return gcd(b, a % b)\n\ndef lcm(a, b):\n return a * b // gcd(a, b)\n\ndef solve(case_no):\n n = int(input())\n cnt=0\n for i in range(n):\n \ta,b = map(int,input().split())\n \tif a==b:\n \t\tcnt += 1\n \t\tif cnt == 3:\n \t\t\tprint("Yes")\n \t\t\texit()\n \telse:\n \t\tcnt=0\n print("No")\n \t\n\nt = 1\n# t = int(input())\nfor i in range(1, t + 1):\n solve(i)\n']

['Runtime Error', 'Accepted']

['s350680684', 's839210170']

[8984.0, 10448.0]

[24.0, 41.0]

[501, 488]

p02547

u224989615

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['n = int(input())\ncount = 0\nfor i in range(n):\n d1, d2 = map(int, input())\n if count == 3:\n break\n elif d1 == d2:\n count += 1\n else:\n count == 0\nif count == 3:\n print("Yes")\nelse:\n print("No")', 'n = int(input())\ncount = 0\nfor i in range(n):\n d1, d2 = map(int, input().split())\n if count > 2:\n break\n else:\n if d1 == d2:\n count += 1\n else:\n count = 0\nif count > 2:\n print("Yes")\nelse:\n print("No")']

['Runtime Error', 'Accepted']

['s127189944', 's594352924']

[9116.0, 8992.0]

[20.0, 27.0]

[206, 225]

p02547

u235837041

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['n = int(input())\n\ndef judge():\n count = 0\n flag = True\n for _ in range(n):\n d1, d2 = map(int, input().split(" "))\n if d1 == d2:\n count += 1\n else:\n count = 0\n \n \n if count == 3:\n flag = True\n break\n else:\n flag = False\n pass\n return flag\n\nif judge():\n print("yes")\nelse:\n print("no")\n\n# if count < 3:\n# print("no")', 'def judge():\n count = 0\n flag = True\n for _ in range(n):\n d1, d2 = map(int, input().split(" "))\n if d1 == d2:\n count += 1\n else:\n count = 0\n \n \n if count == 3:\n print("yes")\n flag = True\n break\n else:\n flag = False\n pass\n return flag\n\nif judge():\n print("yes")\nelse:\n print("no")\n', 'n = int(input())\n\nfor _ in range(n):\n d1, d2 = map(int, input().split(" "))\n if d1 == d2:\n count += 1\nif count >= 3:\n print("yes")\nelse:\n print("no")', 'def judge():\n count = 0\n for _ in range(x):\n d1, d2 = map(int, input().split())\n print(d1, d2)\n if d1 == d2:\n count += 1\n else:\n count = 0\n \n if count == 3:\n return True\n\n return False\n\nx = int(input())\n\nif judge():\n print("yes")\nelse:\n print("no")\n', 'n = int(input())\nfor _ in range(n):\n d1, d2 = map(int, input().split(" "))\n if d1 == d2:\n count += 1\n else:\n count = 0\n \n \n if count >= 3:\n print("yes")\n break\nif count < 3:\n print("no")', 'n = int(input())\ndef judge():\n count = 0\n for _ in range(n):\n d1, d2 = map(int, input().split(" "))\n if d1 == d2:\n count += 1\n else:\n count = 0\n \n if count == 3:\n return True\n\n return False\n\nif judge():\n print("yes")\nelse:\n print("no")', 'def judge():\n count = 0\n for _ in range(n):\n d1, d2 = map(int, input().split(""))\n if d1 == d2:\n count += 1\n else:\n count = 0\n \n if count == 3:\n return True\n\n return False\n\nn = int(input())\n\nif judge():\n print("yes")\nelse:\n print("no")\n', 'def judge():\n count = 0\n for _ in range(n):\n d1, d2 = map(int, input().split(" "))\n if d1 == d2:\n count += 1\n else:\n count = 0\n \n if count == 3:\n return True\n\n return False\n\nn = int(input())\n\nif judge():\n print("yes")\nelse:\n print("no")', 'def judge():\n count = 0\n flag = True\n for _ in range(n):\n d1, d2 = map(int, input().split(" "))\n if d1 == d2:\n count += 1\n else:\n count = 0\n \n \n if count == 3:\n flag = True\n break\n else:\n flag = False\n pass\n return flag\n\nif judge():\n print("yes")\nelse:\n print("no")', 'n = int(input())\ndef judge():\n count = 0\n flag = True\n for _ in range(n):\n d1, d2 = map(int, input().split(" "))\n if d1 == d2:\n count += 1\n else:\n count = 0\n \n \n if count == 3:\n flag = True\n break\n\n flag = False\n \n return flag\n\nif judge() == True:\n print("yes")\nelse:\n print("no")', 'n = int(input())\ndef judge():\n count = 0\n flag = True\n for _ in range(n):\n d1, d2 = map(int, input().split(" "))\n if d1 == d2:\n count += 1\n else:\n count = 0\n \n \n if count == 3:\n return True\n\n return False\n\nif judge() == True:\n print("yes")\nelse:\n print("no")\n', 'n = int(input())\n\ndef judge():\n count = 0\n flag = True\n for _ in range(n):\n d1, d2 = map(int, input().split(" "))\n if d1 == d2:\n count += 1\n else:\n count = 0\n \n \n if count == 3:\n flag = True\n break\n else:\n flag = False\n return flag\n\nif judge() == True:\n print("yes")\nelse:\n print("no")\n', 'def judge():\n count = 0\n for _ in range(x):\n d1, d2 = map(int, input().split())\n if d1 == d2:\n count += 1\n else:\n count = 0\n \n if count == 3:\n return True\n\n return False\n\nx = int(input())\n\nif judge():\n print("Yes")\nelse:\n print("No")\n']

['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']

['s019328189', 's073811425', 's123522765', 's383447239', 's387632846', 's400630199', 's413363390', 's538974585', 's611605273', 's692846754', 's694482230', 's834351922', 's823351008']

[9188.0, 9016.0, 9172.0, 9036.0, 9168.0, 8984.0, 9028.0, 9072.0, 9052.0, 8992.0, 9092.0, 9180.0, 9096.0]

[27.0, 28.0, 30.0, 30.0, 26.0, 26.0, 24.0, 30.0, 22.0, 27.0, 31.0, 26.0, 25.0]

[451, 424, 168, 339, 235, 318, 319, 319, 398, 390, 352, 408, 317]

p02547

u239228953

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

["n = int(input())\nl=[]\nfor i in range(n):\n a,b = list(map(int,list(input().split())))\n l.append([a,b])\ndef fn(n,l):\n for i in range(n-2):\n if l[i][0]==l[i][1] and l[i+1][0]==l[i+1][1] andl[i+2][0]==l[i+2][1]:\n return 'Yes'\n return 'No' \nprint(fn(n,l))\n ", "n = int(input())\nl=[]\nfor i in range(n):\n a,b = list(map(int,list(input().split())))\n l.append([a,b])\ndef fn(n,l):\n for i in range(n-2):\n if l[i][0]==l[i][1] and l[i+1][0]==l[i+1][1] and l[i+2][0]==l[i+2][1]:\n return 'Yes'\n return 'No' \nprint(fn(n,l))"]

['Runtime Error', 'Accepted']

['s381430888', 's903895611']

[9036.0, 9200.0]

[26.0, 33.0]

[266, 264]

p02547

u244466744

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['N = int(input())\nxy = [map(int, input().split()) for _ in range(N)]\nx, y = [list(i) for i in zip(*xy)]\n\ncount = 0\n\nfor i in range(N):\n if x[i] == y[i]:\n count += 1\n if count == 3:\n print("Yes")\n \n else:\n count = 0\n \n \nprint("No")', 'N = int(input())\nxy = [map(int, input().split()) for _ in range(N)]\nx, y = [list(i) for i in zip(*xy)]\n\ncount = 0\n\nfor i in range(N):\n if x[i] == y[i]:\n count += 1\n if count == 3:\n print("Yes")\n exit()\n \n else:\n count = 0\n \n \nprint("No")\n']

['Wrong Answer', 'Accepted']

['s984179940', 's249539419']

[9148.0, 9072.0]

[26.0, 28.0]

[252, 266]

p02547

u244516102

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['N = int(input())\nt = 0\nfor i in range(N):\n a, b = [int(x) for x in input().split()]\n if a != b:\n t = 0\n else:\n t += 1\n if t == 2:\n break\nif t == 3:\n print("Yes")\nelse:\n print("No")\n', 'N = int(input())\nt = 0\nfor i in range(N):\n a, b = [int(x) for x in input().split()]\n if a != b:\n t = 0\n else:\n t += 1\n if t > 2:\n break\nif t > 2:\n print("Yes")\nelse:\n print("No")\n']

['Wrong Answer', 'Accepted']

['s697890366', 's601315937']

[9160.0, 9164.0]

[31.0, 27.0]

[220, 218]

p02547

u244836567

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['a=int(input())\nb=0\nxy = [map(int, input().split()) for in range(a)]\nfor i in range(a-2):\n if a[i]==a[i+1]==a[i+2]:\n b=b+1\nif b==0:\n print("No")\nelse:\n print("Yes")', 'a=int(input())\nb=0\nxy = [map(int, input().split()) for _ in range(a)]\nx, y = [list(i) for i in zip(*xy)]\nfor i in range(a-2):\n if x[i]==y[i] and x==[i+1]==y[i+1] and x==[i+2]==y[i+2]:\n b=b+1\nif b==0:\n print("No")\nelse:\n print("Yes")\n', 'a=int(input())\nb=0\nxy = [map(int, input().split()) for _ in range(a)]\nx, y = [list(i) for i in zip(*xy)]\nfor i in range(a-2):\n if y[i]==y[i+1]==y[i+2]:\n b=b+1\nif b==0:\n print("No")\nelse:\n print("Yes")', 'a=int(input())\nb=0\nxy = [map(int, input().split()) for _ in range(a)]\nx, y = [list(i) for i in zip(*xy)]\nfor i in range(a-2):\n if x[i]==y[i] and x=[i+1]==y[i+1] and x=[i+2]==y[i+2]:\n b=b+1\nif b==0:\n print("No")\nelse:\n print("Yes")', 'a=int(input())\nb=0\nxy = [map(int, input().split()) for _ in range(a)]\nx, y = [list(i) for i in zip(*xy)]\nfor i in range(a-2):\n if x[i]==y[i] and x[i+1]==y[i+1] and x[i+2]==y[i+2]:\n b=b+1\nif b==0:\n print("No")\nelse:\n print("Yes")']

['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted']

['s025419005', 's434769181', 's581159886', 's885656069', 's124907012']

[8956.0, 9088.0, 9180.0, 9036.0, 9080.0]

[27.0, 29.0, 36.0, 28.0, 33.0]

[169, 239, 206, 236, 234]

p02547

u245383302

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['x=int(input())\nList=[]\ncounter=0\nfor i in range(x):\n List.append(list(map(int,input().split())))\nfor i in range(len(List)):\n if List[i][0]==List[i][1]:\n counter+=1\n else:\n counter=0\n if counter ==3:\n print("Yes")\nif counter<3:\n print("No")', 'x=int(input())\nList=[]\ncounter=0\nfor i in range(x):\n List.append(list(map(int,input().split())))\nfor i in range(len(List)):\n if List[i][0]==List[i][1]:\n counter+=1\n else:\n counter=0\n if counter ==3:\n print("Yes")\n break\nif counter<3:\n print("No")']

['Wrong Answer', 'Accepted']

['s872392105', 's741366660']

[9184.0, 9184.0]

[28.0, 28.0]

[253, 263]

p02547

u246401133

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['import sys\nn = int(input())\nx = 0\nfor i in range(n):\n d1, d2 = map(int, input().split())\n if d1 != d2:\n x = 0\n else:\n x += 1\n if x == 3:\n print("Yes")\n sys.exit\nif x != 3:\n print("No")', 'nn = int(input())\nx = 0\nfor i in range(n):\n d1, d2 = map(int, input().split())\n if x != 3:\n if d1 != d2:\n x = 0\n else:\n x += 1\nprint("Yes" if x == 3 else "No")', 'n = int(input())\nx = 0\nfor i in range(n - 2):\n d1, d2 = map(int, input().split())\n if x != 3:\n if d1 != d2:\n x = 0\n else:\n x += 1\nprint("Yes" if x == 3 else "No")', 'n = int(input())\nx = 0\nfor i in range(n):\n d1, d2 = map(int, input().split())\n if x != 3:\n if d1 != d2:\n x = 0\n else:\n x += 1\nprint("Yes" if x == 3 else "No")']

['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted']

['s313568129', 's435875228', 's851164700', 's489082041']

[9068.0, 8996.0, 9120.0, 9168.0]

[32.0, 25.0, 27.0, 28.0]

[239, 201, 204, 200]

p02547

u248670337

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['print("YNEOS"["000" not in "".join([str(eval(input().replace(" ","-")))for _ in "_"*int(input())])::2])', 'print("YNeos"["000" not in "".join([str(eval(input().replace(" ","-")))for _ in "_"*int(input())])::2])']

['Wrong Answer', 'Accepted']

['s210558384', 's817347952']

[9160.0, 9184.0]

[30.0, 31.0]

[103, 103]

p02547

u273914730

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

["N=int(input())\nxy=[map(int,input().split()) for i in range(N)]\nx,y=[list(j) for j in zip(*xy)]\n\ns=0\nwhile s<3:\n for k in range(N):\n if x[k]==y[k]:\n s=s+1\n else:\n s=0\n \nif s>=3:\n print('Yes')\nelse:\n print('No')\n ", "N=int(input())\nxy=[map(int,input().split()) for i in range(N)]\nx,y=[list(j) for j in zip(*xy)]\n\ns=0\nflag=False\nfor k in range(N):\n if x[k]==y[k]:\n s=s+1\n if s==3:\n flag=True\n break\n else:\n s=0\n \nif flag==True:\n print('Yes')\nelse:\n print('No')\n "]

['Time Limit Exceeded', 'Accepted']

['s472794179', 's575174516']

[9044.0, 9192.0]

[2206.0, 33.0]

[241, 299]

p02547

u274755552

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['n = int(input())\nx, y = [], []\nfor i in range(n)\n x_, y_ = map(int, input().split())\n x.append(x_)\n y.append(y_)\nfor i in range(n-2)\n if x[i]==y[i] and x[i+1]==y[i+1] and x[i+2]==y[i+2]:\n print("Yes")\n break\n else:\n print("No")', 'n = int(input())\nx, y = [], []\nfor i in range(n)\n x_, y_ = map(int, input().split())\n x.append(x_)\n y.append(y_)\nfor i in range(n-2)\n if x[i]==y[i] and x[i+1]==y[i+1] and x[i+2]==y[i+2]:\n print("Yes")\n break\nelse:\n print("No")', 'n = int(input())\nx, y = [], []\nfor i in range(n)\nx_, y_ = map(int, input().split())\nx.append(x_)\ny.append(y_)\nfor i in range(n-2)\nif x[i]==y[i] and x[i+1]==y[i+1] and x[i+2]==y[i+2]:\n print("Yes")\n break\nelse:\n print("No")', 'n = int(input())\nx, y = [], []\nfor i in range(n):\n x_, y_ = map(int, input().split())\n x.append(x_)\n y.append(y_)\nfor i in range(n-2):\n if x[i]==y[i] and x[i+1]==y[i+1] and x[i+2]==y[i+2]:\n print("Yes")\n break\nelse:\n print("No")']

['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']

['s048111233', 's324937292', 's944901128', 's762258995']

[9008.0, 8876.0, 8772.0, 9204.0]

[23.0, 24.0, 25.0, 31.0]

[241, 237, 225, 239]

p02547

u275392848

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['l=[]\nn=int(input())\nfor _ in range(n):\n a=list(map(int,input().split()))\n l.append(a)\n\nflag=0\nfor i in range(1,n-1):\n if l[i-1][0]==l[i-1][1] and l[i][0]==l[i][1] and l[i+1][0]==l[i+1][1]:\n flag=1\n break\n\nif flag==1:\n print("YES")\nelse:\n print("NO")', 'l=[]\nn=int(input())\nfor _ in range(n):\n a=list(map(int,input().split()))\n l.append(a)\n\nflag=0\nfor i in range(1,n-1):\n if l[i-1][0]==l[i-1][1] and l[i][0]==l[i][1] and l[i+1][0]==l[i+1][1]:\n flag=1\n break\n\nif flag==1:\n print("Yes")\nelse:\n print("No")']

['Wrong Answer', 'Accepted']

['s815750085', 's664658596']

[9196.0, 9200.0]

[26.0, 30.0]

[262, 262]

p02547

u275893569

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

["n = int(input())\nstr_list = [list(input().split()) for _ in range(n)]\nprint(str_list)\nans = 0\nfor i in range(n-2):\n if str_list[i][0] == str_list[i][1]:\n if str_list[i+1][0] == str_list[i+1][1]:\n if str_list[i+2][0] == str_list[i+2][1]:\n ans += 1\n \nif ans:\n print('Yes')\nelse:\n print('No')", "n = int(input())\nstr_list = [list(input().split()) for _ in range(n)]\nans = 0\nfor i in range(n-2):\n if str_list[i][0] == str_list[i][1]:\n if str_list[i+1][0] == str_list[i+1][1]:\n if str_list[i+2][0] == str_list[i+2][1]:\n ans += 1\n \nif ans:\n print('Yes')\nelse:\n print('No')\n"]

['Wrong Answer', 'Accepted']

['s399922674', 's540510210']

[9064.0, 9068.0]

[31.0, 33.0]

[334, 319]

p02547

u293326264

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

["n = int(input())\nli = [0] * n\nfor i in range(n):\n a, b = [int(x) for x in input().split()]\n li.append([a,b])\ncount = 0\nfor i in li:\n if i[0] == i[1]:\n count += 1\n else:\n count = 0\n\nif count == 0: print('Yes')\nelse: print('No')", "n = int(input())\nli = list()\nfor i in range(n):\n a, b = [int(x) for x in input().split()]\n li.append([a,b])\n\ncount = 0\nfor i in li:\n if count < 3:\n if i[0] == i[1]:\n count += 1\n else:\n count = 0\n else:\n break\n\nif count >= 3: print('Yes')\nelse: print('No')"]

['Runtime Error', 'Accepted']

['s559399746', 's023732795']

[9188.0, 9200.0]

[24.0, 34.0]

[252, 310]

p02547

u304612256

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

["input = stdin.readline\n\nN = int(input())\n\nb = False\ncnt = 0\nfor i in range(N):\n D1, D2 = map(int, input().split())\n if D1 == D2:\n cnt += 1\n if cnt == 3:\n b = True\n else:\n cnt = 0\n\nif b == False:\n print('No')\nelse:\n print('Yes')", "from sys import stdin\ninput = stdin.readline\n\nN = int(input())\n\nb = False\ncnt = 0\nfor i in range(N):\n D1, D2 = map(int, input().split())\n if D1 == D2:\n cnt += 1\n if cnt == 3:\n b = True\n else:\n cnt = 0\n\nif b == True:\n print('Yes')\nelse:\n print('No')"]

['Runtime Error', 'Accepted']

['s286164768', 's797652176']

[9112.0, 9024.0]

[24.0, 31.0]

[274, 295]

p02547

u309120194

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

["N = int(input())\nD = [list(map(int, input().split())) for _ in range(N)]\n \nfor i in range(N-2):\n if D[i][0] == D[i][1] and D[i+1][0] == D[i+1][1] and D[i+2][0] == D[i+2][1]:\n print('Yes')\n break\n \nprint('No')", "N = int(input())\nD = [list(map(int, input().split())) for _ in range(N)]\n \nans = 'No'\nfor i in range(N-2):\n if D[i][0] == D[i][1] and D[i+1][0] == D[i+1][1] and D[i+2][0] == D[i+2][1]:\n ans = 'Yes'\n break\n \nprint(ans)"]

['Wrong Answer', 'Accepted']

['s869564967', 's009848126']

[9024.0, 9184.0]

[27.0, 33.0]

[218, 227]

p02547

u318233626

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['n = int(input())\nD_1 = [0 for i in range(n)]\nD_2 = [0 for i in range(n)]\nfor i in range(n):\n D_1[i], D_2[i] = map(int, input().split())\n\ntmp = 0\nans = 0\nfor i in range(n):\n if D_1[i] == D_2[i]:\n tmp += 1\n else:\n ans = max(tmp, ans)\n tmp = 0\nans = max(tmp, ans)\n\nprint(ans)\nif ans >= 3:\n print("Yes")\nelse:\n print("No")', 'n = int(input())\nD_1 = [0 for i in range(n)]\nD_2 = [0 for i in range(n)]\nfor i in range(n):\n D_1[i], D_2[i] = map(int, input().split())\n\ntmp = 0\nans = 0\nfor i in range(n):\n if D_1[i] == D_2[i]:\n tmp += 1\n else:\n ans = max(tmp, ans)\n tmp = 0\nans = max(tmp, ans)\n\nif ans >= 3:\n print("Yes")\nelse:\n print("No")']

['Wrong Answer', 'Accepted']

['s434885296', 's814281057']

[9204.0, 9196.0]

[28.0, 32.0]

[354, 343]

p02547

u333537444

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

["\ndef input_int():\n return(int(input()))\n\ndef input_int_list():\n return(list(map(int,input().split())))\n\ndef input_int_map():\n return(map(int,input().split()))\n\ndef run():\n q_num = input_int()\n\n count_num = 0\n\n for _ in range(q_num):\n\n a, b = input_int_map()\n\n if a == b:\n count_num += 1\n\n if count_num == 3:\n print('YES')\n return\n else:\n count_num = 0\n\n print('NO')\n\nrun()\n\n", "\ndef input_int():\n return(int(input()))\n\ndef input_int_list():\n return(list(map(int,input().split())))\n\ndef input_int_map():\n return(map(int,input().split()))\n\ndef run():\n q_num = input_int()\n\n count_num = 0\n\n for _ in range(q_num):\n\n a, b = input_int_map()\n\n if a == b:\n count_num += 1\n\n if count_num == 3:\n print('Yes')\n return\n else:\n count_num = 0\n print('No')\n\nrun()\n\n"]

['Wrong Answer', 'Accepted']

['s723935616', 's584098871']

[9184.0, 9184.0]

[29.0, 30.0]

[479, 478]

p02547

u340064601

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

["input=__import__('sys').stdin.readline\nans='NO'\ncs=0\nfor i in range(int(input())):\n\ta,b=map(int,input().split())\n\tif a==b:cs+=1\n\telse:cs=0\n\tif cs>=3:ans='YES'\nprint(ans)", "input=__import__('sys').stdin.readline\nans='No'\ncs=0\nfor i in range(int(input())):\n\ta,b=map(int,input().split())\n\tif a==b:cs+=1\n\telse:cs=0\n\tif cs>=3:ans='Yes'\nprint(ans)"]

['Wrong Answer', 'Accepted']

['s836428931', 's680191211']

[9172.0, 9168.0]

[33.0, 31.0]

[169, 169]

p02547

u344512965

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['N = int(input())\nDi1 = []\nDi2 = []\nnmDi = 0\nif N >= 3 and N <= 100:\n for x in range(N):\n Di1.append(int(input()))\n Di2.append(int(input()))\n for x in range(N):\n if Di1[x] == Di2[x]:\n nmDi += 1\n if nmDi == 3:\n break\n elif Di1[x] != Di2[x] and nmDi > 0:\n nmDi = 0\n if nmDi >= 3:\n print("Yes")\n else:\n print("No")', 'N = int(input())\nDi1 = []\nDi2 = []\nnmDi = 0\nif N >= 3 and N <= 100:\n for x in range(N):\n Di1.append(int(input()))\n Di2.append(int(input()))\nfor x in range(N):\n if Di1[x] == Di2[x]:\n nmDi += 1\n if nmDi == 3:\n break\n elif Di1[x] != Di2[x] and nmDi > 0:\n nmDi = 0\nif nmDi >= 3:\n print("Yes")\nelse:\n print("No")', 'N = int(input())\nDi1 = []\nDi2 = []\nnmDi = 0\nif N >= 3 and N <= 100:\n for x in range(N):\n Di1.append(int(input()))\n Di2.append(int(input()))\n for x in range(N):\n if Di1[x] == Di2[x]:\n nmDi += 1\n if nmDi == 3:\n break\n elif Di1[x] != Di2[x] and nmDi > 0:\n nmDi = 0\n if nmDi >= 3:\n print("Yes")\n else:\n print("No")\nelse:\n print ("No")', 'N = int(input())\nDi = 0\nDi1 = []\nDi2 = []\nnmDi = 0\nif N >= 3 and N <= 100:\n for x in range(N):\n Di = input()\n Di1.append(Di[0])\n Di2.append(Di[-1])\n for x in range(N):\n if Di1[x] == Di2[x]:\n nmDi += 1\n if nmDi == 3:\n break\n elif Di1[x] != Di2[x] and nmDi > 0:\n nmDi = 0\n if nmDi >= 3:\n print("Yes")\n else:\n print("No")\nelse:\n print ("No")']

['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']

['s109386780', 's157533507', 's543568275', 's923184656']

[9112.0, 9136.0, 9204.0, 9140.0]

[29.0, 28.0, 29.0, 30.0]

[383, 350, 405, 418]

p02547

u345132740

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['n=int(input())\nm=0\nfor i in range(n):\n A,B=map(int,input().split())\n if (A==B):\n m=m+1\n else:\n m=0\n if (m==3):\n print("Yes")\n break\nprint("No")', 'n=int(input())\nm=0\nl=0\nfor i in range(n):\n A,B=map(int,input().split())\n if (A==B):\n m+=1\n else:\n m=0\n if (m==3):\n print("Yes")\n l=1\n break\n\nif (l==0):\n print("No")']

['Wrong Answer', 'Accepted']

['s675996431', 's928785145']

[9140.0, 9088.0]

[27.0, 28.0]

[159, 184]

p02547

u351207073

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['# -*- coding: utf-8 -*-\n\nN = int(input())\n\nl = []\nfor i in range(N):\n d1, d2 = map(int, input().split())\n l.append([d1, d2])\nprint(l)\n\nflag = 0\ncont = 0\nfor i in l:\n if(i[0]==i[1]):\n flag = 1\n cont = cont + 1\n print(cont)\n if (cont>=3):\n break\n else:\n cont = 0\n flag =0\n\n\n\nif (cont >=3):\n print("Yes")\nelse:\n print("No")\n', '# -*- coding: utf-8 -*-\n\nN = int(input())\n\nl = []\nfor i in range(N):\n d1, d2 = map(int, input().split())\n l.append([d1, d2])\n\nflag = 0\ncont = 0\nfor i in l:\n if(i[0]==i[1]):\n flag = 1\n cont = cont + 1\n if (cont>=3):\n break\n else:\n cont = 0\n flag =0\n\n\n\nif (cont >=3):\n print("yes")\nelse:\n print("no")\n', '# -*- coding: utf-8 -*-\n\nN = int(input())\n\nl = []\nfor i in range(N):\n d1, d2 = map(int, input().split())\n l.append([d1, d2])\n\nnum = 0\ncont = 0\nfor i in l:\n if(i[0]==i[1]):\n num = num + 1\n cont = cont +1\n else:\n num = 0\n cont = 0\n\nif (cont >=3):\n print("yes")\nelse:\n print("no")\n', '# -*- coding: utf-8 -*-\n\nN = int(input())\n\nl = []\nfor i in range(N):\n d1, d2 = map(int, input().split())\n l.append([d1, d2])\n\nflag = 0\ncont = 0\nfor i in l:\n if(i[0]==i[1]):\n flag = 1\n cont = cont + 1\n if (cont>=3):\n break\n else:\n cont = 0\n flag =0\n\n\n\nif (cont >=3):\n print("yes")\nelse:\n print("no")\n', '# -*- coding: utf-8 -*-\n\nN = int(input())\n\nl = []\nfor i in range(N):\n d1, d2 = map(int, input().split())\n l.append([d1, d2])\n#print(l)\n\nflag = 0\ncont = 0\nfor i in l:\n if(i[0]==i[1]):\n flag = 1\n cont = cont + 1\n #print(cont)\n if (cont>=3):\n break\n else:\n cont = 0\n flag =0\n\n\n\nif (cont >=3):\n print("Yes")\nelse:\n print("No")\n']

['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']

['s018640870', 's369042724', 's719265447', 's981227561', 's029113086']

[9204.0, 9192.0, 9120.0, 9052.0, 9188.0]

[31.0, 32.0, 34.0, 29.0, 30.0]

[400, 371, 332, 371, 402]

p02547

u352676541

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['N = int(input())\n\nD = []\nfor i in range(N):\n D.append(list(map(int,input().split())))\n\nfor i in range(N-2):\n if D[i][0] == D[i][1] and D[i+1][0] == D[i+1][1] and D[i+2][0] == D[i+2][1]:\n ans = "Yes"\n else:\n ans = "No"\nprint(ans)', 'N = int(input())\n\nD = []\nfor i in range(N):\n Da,Db = (map(int,input().split()))\n if Da == Db:\n D.append(1)\n else:\n D.append(0)\n\nfor i in range(N-2):\n if D[i]==1 and D[i+1] == 1 and D[i+2] == 1:\n ans = "Yes"\n else:\n ans = "No"\nprint(ans)', 'N = int(input())\n\nD = []\nfor i in range(N):\n D.append(list(map(int,input().split())))\n\nfor i in range(N):\n if D[i][0] == D[i][1] and D[i+1][0] == D[i+1][1] and D[i+2][0] == D[i+2][1]:\n ans = "Yes"\n else:\n ans = "No"\nprint(ans)', 'N = int(input())\n\nD = []\nfor i in range(N):\n Da,Db = (map(int,input().split()))\n if Da == Db:\n D.append(1)\n else:\n D.append(0)\n\nfor i in range(N-2):\n if D[i]==1 and D[i+1] == 1 and D[i+2] == 1:\n ans = "Yes"\n break:\n else:\n ans = "No"\nprint(ans)', 'N = int(input())\n\nD = []\nfor i in range(N):\n Da,Db = (map(int,input().split()))\n if Da == Db:\n D.append(1)\n else:\n D.append(0)\n\nfor i in range(N-2):\n if D[i]==1 and D[i+1] == 1 and D[i+2] == 1:\n ans = "Yes"\n break\n else:\n ans = "No"\nprint(ans)']

['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted']

['s535569318', 's745738457', 's755385220', 's937205014', 's320932694']

[9200.0, 9188.0, 9200.0, 9036.0, 9188.0]

[28.0, 28.0, 28.0, 28.0, 28.0]

[251, 279, 249, 294, 293]

p02547

u357086816

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['# -*- coding: utf-8 -*-\na = int(input())\nxy = [map(int, input().split()) for _ in range(a)]\nx, y = [list(i) for i in zip(*xy)]\nflag = 0\nfor i in range(a):\n if (x[i] == y[i]):\n flag = flag+1\n else:\n flag = 0\nif flag >= 3:\n print("Yes")\nelse:\n print("No")\n\n', '# -*- coding: utf-8 -*-\na = int(input())\nxy = [map(int, input().split()) for _ in range(a)]\nx, y = [list(i) for i in zip(*xy)]\nflag = 0\nb=0\nfor i in range(a):\n if (x[i] == y[i]):\n flag = flag+1\n if (flag ==3):\n b = 1\n else:\n flag = 0\n \nif b==1:\n print("Yes")\nelse:\n print("No")\n\n\n\n']

['Wrong Answer', 'Accepted']

['s118300528', 's317545684']

[9144.0, 9184.0]

[31.0, 33.0]

[275, 316]

p02547

u380791283

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['#B\nn = int(input())\ncount=0\nmcount=0\nfor i in range(n):\n a,b = list(map(int, input().split()))\n if a==b:\n count+=1\n if mcount<count:\n mcount = count\n if mcount=3:\n break\n else:\n count=0\nif mcount=3:\n print("Yes")\nelse:\n print("No")', '#B\nn = int(input())\ncount=0\nmcount=0\nfor i in range(n):\n a,b = list(map(int, input().split()))\n if a==b:\n count+=1\n if mcount<count:\n mcount = count\n if mcount==3:\n break\n else:\n count=0\nif mcount==3:\n print("Yes")\nelse:\n print("No")']

['Runtime Error', 'Accepted']

['s019844052', 's211221356']

[9020.0, 9184.0]

[31.0, 28.0]

[304, 306]

p02547

u380933932

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['n=int(intpu())\nflag=0\nfor i in range(n):\n a=list(map(int,input().split()))\n if a[0]==a[1]:\n flag+=1\n else:\n flag=0\n if flag==3:\n break\nif flag==3:\n print("Yes")\nelse:\n print("No")', 'n=int(input())\nflag=0\nfor i in range(n):\n a=list(map(int,input().split()))\n if a[0]==a[1]:\n flag+=1\n else:\n flag=0\n if flag==3:\n break\nif flag==3:\n print("Yes")\nelse:\n print("No")']

['Runtime Error', 'Accepted']

['s361964637', 's056954893']

[8988.0, 9064.0]

[25.0, 25.0]

[194, 194]

p02547

u382639013

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['t = int(input())\ncon = []\nfor i in range(t):\n a, b = map(int, input().split())\n if a==b:\n con.append(1)\n else:\n con.append(0)\n ans =0\nfor i in con:\n if i ==1:\n ans += 1\n else:\n ans = 0\nif ans >= 3:\n print("Yes")\nelse:\n print("No")', 't = int(input())\ncon = []\nfor i in range(t):\n a, b = map(int, input().split())\n if a==b:\n con.append(1)\n else:\n con.append(0)\n ans =0\na = []\nfor i in con:\n if i ==1:\n ans += 1\n a.append(ans)\n else:\n ans = 0\n a.append(ans)\nif max(a) >= 3:\n print("Yes")\nelse:\n print("No")']

['Wrong Answer', 'Accepted']

['s144301759', 's412261384']

[9184.0, 9192.0]

[26.0, 28.0]

[282, 336]

p02547

u384796740

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['N=int(input())\nx=[]\nfor i in range(N):\n x.append(list(map(int,input().split())))\nfor i in range(N-2):\n if x[i][0]==x[i][1] and x[i+1][0]==x[i+1][1] and x[i+2][0]==x[i+2][1]:\n print("Yes")\n break\n else:\n print("No")\n break', 'N=int(input())\nx=[]\nfor i in range(N):\n x.append(list(map(int,input().split())))\nfor i in range(N-2):\n if x[i][0]==x[i][1] and x[i+1][0]==x[i+1][1] and x[i+2][0]==x[i+2][1]:\n print("Yes")\n break\nelse:\n print("No")']

['Wrong Answer', 'Accepted']

['s559296330', 's519991060']

[9196.0, 9192.0]

[30.0, 37.0]

[258, 237]

p02547

u388164885

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['n = int(input())\nflag = 0\nfor i in range(n):\n n1, n2 = map(int, input().split())\n if n1 == n2:\n flag += 1\n if flag == 3:\n print("Yse")\n break\n else:\n flag = 0\nprint("No")', 'n = int(input())\nflag = 0\nans = 0\nfor i in range(n):\n n1, n2 = map(int, input().split())\n if n1 == n2:\n flag += 1\n ans = max(ans, flag)\n else:\n flag = 0\nif ans >= 3:\n print("Yes")\nelse:\n print("No")']

['Wrong Answer', 'Accepted']

['s910435250', 's877917862']

[9156.0, 9172.0]

[30.0, 32.0]

[222, 234]

p02547

u389530753

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['N=int(input())\ncount=0\nfor i in range(N):\n a,b=map(int,input().split())\n\n if a==b:\n count+=1\n if count==3:\n print("Yes")\n \n else:\n pass\n \n else :\n count=0\n\nif count !=3:\n print(\'No\')\n', 'N=int(input())\ncount=0\nfor i in range(N):\n a,b=map(int,input().split())\n\n if a==b:\n count+=1\n if count==3:\n print("Yes")\n exit()\n else:\n pass\n \n else :\n count=0\n\nif count !=3:\n print(\'No\')']

['Wrong Answer', 'Accepted']

['s118921655', 's675074538']

[9176.0, 9180.0]

[33.0, 33.0]

[267, 272]

p02547

u402228762

Tak performed the following action N times: rolling two dice. The result of the i-th roll is D_{i,1} and D_{i,2}. Check if doublets occurred at least three times in a row. Specifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.

['a = int(input())\ncount = 0\nfor i in range(a):\n a,b = map(int,input().split())\n \n if (a==b):\n count += 1\n else : \n count = 0\n\nif (count >= 3):\n \n print("Yes")\nelse :\n print("No")\n', 'c = int(input())\ncount = 0\n\nd = [list(map(int,input().split())) for i in range(c)]\nfor i in range(c):\n a,b = d[i][0],d[i][1]\n \n if (a==b):\n count += 1\n else : \n count = 0\n\nif (count >= 3):\n \n print("Yes")\nelse :\n print("No")\n', 'c = int(input())\ncount = 0\n\nd = [list(map(int,input().split())) for i in range(c)]\nfor i in range(c):\n a,b = d[i][0],d[i][1]\n \n if (a==b):\n count += 1\n if ( count == 3):\n break\n else : \n count = 0\n\nif (count >= 3):\n \n print("Yes")\nelse :\n print("No")\n']

['Wrong Answer', 'Wrong Answer', 'Accepted']

['s030753017', 's164144073', 's271717889']

[9160.0, 9176.0, 9116.0]

[32.0, 33.0, 28.0]

[217, 264, 308]