TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
N = int(input())
S = input()

if N % 2 == 1:
  print('No')
  exit()

if S[:N/2] == S[N/2:]:
  print('Yes')
else:
  print('No')

N = int(input())
S = input()

if S[:N//2] == S[N//2:]:
  print('Yes')
else:
  print('No')

Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = str(input())
if len(n) % 2 ==1:
  print('No')
else:
  a = n[0 : len(n)/2]
  b = n[len(n)/2 : len(n)]
  if a == b:
    print('Yes')
  else:
    print('No')

n = str(input())

if len(n) % 2 == 1:
  print('No')
else:
  a = n[0 : len(n)//2]
  b = n[len(n)//2 : len(n)]
  if a == b:
    print('Yes')
  else:
    print('No')

n = str(input())

if len(n) % 2 == 1:
  print('No')
else:
  a = n[0 : len(n)//2]
  b = n[len(n)//2 : len(n)]
  if a == b:
    print('Yes')
  else:
    print('No')

n = str(input())
if len(n) % 2 ==1:
  print('No')
else:
  a = n[0 : len(n)/2]
  b = n[len(n)/2 : len(n)]
  if a = b:
    print('Yes')
  else:
    print('No')

nn = input()
n = str(input())

if len(n) % 2 == 1:
  print('No')
else:
  a = n[0 : len(n)//2]
  b = n[len(n)//2 : len(n)]
  if a == b:
    print('Yes')
  else:
    print('No')

Verdicts: Runtime Error

Wrong Answer

Wrong Answer

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = int(input())
s = input()
if n%2==1:
  print("NO") 
elif:
  s1 = ""
  s2 = ""
  for i in range(0, n/2):
    s1+=s[i]
    s2+=s[n/2 + i]
  if(s1 == s2):
    print("YES")
  else:
    print("NO")


n = int(input())
s = input()
if n%2==1:
  print("NO") 
elif s[0:n/2] == s[n/2]:
  print("YES")
else:
  print("NO")

n = int(input())
s = input()
if n%2==1:
    print("NO") 
else:
    s1 = ""
    s2 = ""
    for i in range(0, n//2):
        s1+=s[i]
        s2+=s[n//2 + i]
    if(s1 == s2):
        print("YES")
    else:
        print("NO")


n = int(input())
s = input()
if n%2==1:
  print("NO") 
elif s[0:n/2] == s[n/2:-1]:
  print("YES")
else:
  print("NO")


n = int(input())
s = input()
if n%2==1:
    print("No") 
else:
    s1 = ""
    s2 = ""
    for i in range(0, n//2):
        s1+=s[i]
        s2+=s[n//2 + i]
    if(s1 == s2):
        print("Yes")
    else:
        print("No")


Verdicts: Runtime Error

Runtime Error

Wrong Answer

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
N = int(input())
S = input()
if N % 2 == 0:   
    if S[:N / 2] == S[N / 2:]:
        print("Yes")
    else:
        print("No")
else:
    print("No")

N = int(input())
S = input()
S1 = S[:N / 2]
S2 = S[N / 2:]
if N > 1 or (N % 2) != 0 or S1 != S2:
    print("No")
else:
    print("Yes")

N = int(input())
S = input()
S1 = S[:(N // 2)]
S2 = S[(N // 2):]
if N < 1 or (N % 2) == 1 or S1 != S2:
    print("No")
else:
    print("Yes")

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = int(input())
s = input()
if n%2==0:
    a = s[0:(n/2-1)]
    b = s[(n/2):]
    if a==b:
        print("Yes")
else:
    print("No")

n = int(input())
s = input()
if n%2==2:
    a = s[0:(n/2-1)]
    b = s[(n/2):]
    if a==b:
        print("Yes")
else:
    print("No")

n = int(input())
s = input()
if n%2==0:
    a = s[0:(int(n/2))]
    b = s[(int(n/2)):n]
    if a==b:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
import sys
input = sys.stdin.readline

n=int(input())
s=input()
s1=s[:n//2]
s2=s[n//2:]
if s1==s2:
    print("Yes")
else:
    print("No")

import sys
input = sys.stdin.readline

n=int(input())
s=input()
if n%2==1:
    print("No")
    sys.exit()
s1=s[:n//2]
s2=s[n//2:]
if s1==s2:
    print("Yes")
else:
    print("No")

import sys
input = sys.stdin.readline

n=int(input())
s=input()
l=[]
m=[]
if n%2==1:
  print("No")
  sys.exit()
for i in range(n//2):
  l.append(s[i])
for _ in range(n//2,n):
  m.append(s[_])
print("Yes" if l==m else "No")

  

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
s = input()

if n % 2 == 0:
    N = int(n / 2)
    a = s[:N]
    b = s[N:]
    if a == b:
        print('Yes')
    else:
        print('No')
else:
    print('No')

n = int(input())
s = input()

if n % 2 == 0:
    N = int(n / 2)
    a = s[:N]
    b = s[N:]
    if a == b:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
s=input()
S=('Yes' * (s[0:len(s)//2]==s[len(s)//2::])) or 'No'
print(S)

a=int(input())
s=input()
S=('Yes' * (s[0:a//2]==s[a//2::])) or 'No'
print(S)

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
N = int(input())
S = input()
if N % 2 > 0 or S != S[:int(N/2)] + S[:int(N/2)]:
    exit("No")
exit("Yes")

N = int(input())
S = input()
if N % 2 > 0 or S != S[:int(N/2)] + S[:int(N/2)6]:
    exit("No")
exit("Yes")

N = int(input())
S = input()
if N % 2 > 0 or S != S[:int(N/2)] + S[:int(N/2)]:
    print("No")
else:
    print("Yes")


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
def moji_hanbetsu(S,N):
    if N % 2 == 1:
        ans = "no"
    else:
        n = int(N/2)
        s1 = S[0:n]
        s2 = S[-n:]
        if s1 == s2:
            ans="yes"
        else:
            ans ="no"
    return ans

S="abcabc"
N=6
print(moji_hanbetsu(S,N))

def moji_hanbetsu(S,N):
    if N % 2 == 1:
        ans = "no"
    else:
        n = int(N/2)
        s1 = S[0:n]
        s2 = S[-n:]
        if s1 == s2:
            ans="yes"
        else:
            ans ="no"
    return ans
 
N,S = input()

def moji_hanbetsu(S,N):
    if (N % 2) == 1:
        ans = "no"
    else:
        n = int(N/2)
        s1 = S[0:n]
        s2 = S[-n:]
        if s1 == s2:
            ans="yes"
        else:
            ans ="no"
    return ans
 
N = int(input())
S = input()

print(moji_hanbetsu(S,N))

N = int(input())
S = input()

if (N % 2) == 1:
    ans = "No"
else:
    n = int(N/2)
    s1 = S[0:n]
    s2 = S[-n:]
    if s1 == s2:
        ans="Yes"
    else:
        ans ="No"
print(ans)

Verdicts: Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
def solve(string):
    n, s = string.split()
    n = int(n)
    return "Yes" if s[:n // 2] == s[n // 2:] else "No"


if __name__ == '__main__':
    print(solve(input()))


def solve(string):
    n, s = string.split()
    n = int(n)
    return "Yes" if s[:n // 2] == s[n // 2:] else "No"


if __name__ == '__main__':
    print(solve('\n'.join([input(), input()])))


Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
N = int(input())
S = input()

if S[:N // 2] == S[N // 2:]:
  print("Yes")
if N % 2 == 1:
  print("No")
else:
  print("No")

from sys import exit

N = int(input())
S = input()

if N % 2 == 1:
  print("No")
  exit()
  
if S[:N // 2] == S[N // 2:]:
  print("Yes")
else:
  print("No")

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = int(input())
s = input()

t = s[:n//2]
print(s == t + t)

n = int(input())
s = input()
 
t = s[:n//2]
if s == t + t:
  print("Yes")
else:
  print("No")

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = int(input())
s = list(input())

if n % 2 == 1:
    print('No')
    exit()

print('Yes') if s[:n/2] == s[n/2:] else print('No')

n=int(input())//2;s=input();print('Yes' if s[:n] == s[n:] else 'No')

Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
x=int(input())
t=int(x/2)
y=str(input())
if x%2!=0:
  print("No")
  exit()
for i in range(x):
  if y[i]!=y[i+x]:
    print("No")
    exit()
print("Yes")

x=int(input())
t=int(x/2)
y=str(input())
if x%2!=0:
  print("No")
  exit()
for i in range(t):
  if y[i]!=y[i+t]:
    print("No")
    exit()
print("Yes")

Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = int(input())
s = input()
if n%2 != 0:
  prtin("No")
elif s[int(:n/2)] == s[int(n/2):]:
  print("Yes")
else:
  print("No")

n = int(input())
s = input()
if n%2 != 0 or n == 1:
  print("No")
elif s[:int(n/2)] == s[int(n/2):]:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
import sys
 
if __name__ == '__main__':
  r = int(input())
  a = r.split('\n')
  n = a[0]
  s = a[1]
  print(n)


import sys
 
def exec(n, s):
  r = 'No'
  if n % 2 != 0:
    return r
  hs = s[0:int(n/2)]
  if hs + hs == s:
    r = 'Yes'
  return r
    
    
if __name__ == '__main__':
  r = [input(), input()]
  n = int(r[0])
  s = r[1]
  print(exec(n, s))

Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
import sys
input = sys.stdin.readline

_n = int(input())
_s = input()


def chker(n, s):
    if n % 2 != 0:
        print('No')
        return

    hs = len(s) // 2
    ls, rs = s[:hs], s[hs:]
    if ls == rs:
        print('Yes')
    else:
        print('No')


chker(_n, _s)


import sys
input = sys.stdin.readline

_n = int(input())
_s = input()[:-1]


def chker(n, s):
    if n % 2 != 0:
        print('No')
        return

    hs = len(s) // 2
    ls, rs = s[:hs], s[hs:]
    if ls == rs:
        print('Yes')
    else:
        print('No')


chker(_n, _s)


Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
def resolve():
    n=int(input())
    s=input()
    if n%2!=0 and s[:n//2]==s[n//2:]:
        print('Yes')
    else:
        print('No')
resolve()

def resolve():
    n=int(input())
    s=input()
    if n%2==0 and s[:n//2]==s[n//2:]:
        print('Yes')
    else:
        print('No')
resolve()

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n=int(input())
s=input()

print(2*s[:n//2])

if n%2!=0:
  print("No")
else:
  if 2*s[:n//2]==s:
    print("Yes")
  else:
    print("No")

n=int(input())
s=input()



if n%2!=0:
  print("No")
else:
  if 2*s[:n//2]==s:
    print("Yes")
  else:
    print("No")

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
s=input()
if len(s)%2:
	print("No")
elif s[:((len(s)/2)]==s[(len(s)/2):]:
    print("Yes")
else:
    print("No")

s=input()
if len(s)%2:
  print("No")
elif s[:len(s)/2]==s[len(s)/2:]:
  print("Yes")
 else:
  print("No")

ln=input()
s=input()
if len(s)%2:
	print("No")
elif s[:((len(s)/2)]==s[(len(s)/2):]:
    print("Yes")
else:
    print("No")

ln=input()
s=input()
if len(s)%2:
    print("No")
elif s[:(len(s)//2)]==s[(len(s)//2):]:
    print("Yes")
else:
    print("No")


Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
s = input()
print("Yes" if s[:len(s) // 2] == s[len(s) // 2:] else "No")

n = int(input())
s = input()
print("Yes" if s[:len(s) // 2] == s[len(s) // 2:] and len(s) % 2 == 0 else "No")

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
N = int(input())
S = input()

if (N%2) != 0:
    print('NO')
elif(S[:(N//2)]==S[(N//2):]):
    print('YES')
else:
    print('NO')

N = int(input())
S = input()

if (N%2) != 0:
    print('No')
elif(S[:(N//2)]==S[(N//2):]):
    print('Yes')
else:
    print('No')


Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
N = int(input())
S = input()

v = [S[i:i+N//2] for i in range(0, len(S), 2)]


if N/2!=N//2:
  print("No")

if v[0] == v[1]:
  print("Yes")
else:
  print("No")





N = int(input())
S = input()

v = [S[i:i+N//2] for i in range(0, len(S), 2)]

if v[0] == v[1]:
  print("Yes")
else:
  print("No")




n = int(input())
s = input()

if n%2 == 1:
  print("No")
else:
  if s[0:n//2] == s[n//2:n]:
    print("Yes")
  else:
    print("No")

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n=int(input())
s=input()

if s[:(n//2)]!=s[-(n//2):] or n/2!=0:
  print('No')
else:
  print('Yes')

import math
import heapq
import sys
from collections import Counter




N=int(input())
S=input()
if N%2==1:
    print('No')
    exit()

#print(S[:N//2],S[-(N//2):])

if S[:N//2]==S[-(N//2):]:
    print('Yes')
else:
    print('No')


Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
import sys

input = sys.stdin.readline

N = int(input())
S = input().rstrip()

if N % 2 != 0:
    print('No')
else:
    mid = int(N / 2)
    head = S[:mid]
    S2 = head + head
    print(S)
    print(S2)
    if S == S2:
        print('Yes')
    else:
        print('No')

import sys

input = sys.stdin.readline

N = int(input())
S = input()

if N % 2 != 0:
    print('No')
else:
    mid = int(N / 2)
    head = S[:mid]
    end = S[mid:]

    if head == end:
        print('Yes')
    else:
        print('No')

import sys

input = sys.stdin.readline

N = int(input())
S = input().rstrip()

if N % 2 == 1:
    print('No')
else:
    mid = int(N / 2)
    head = S[:mid].rstrip()
    S2 = head + head
    #print(S)
    #print(S2)
    if S == S2:
        print('Yes')
    else:
        print('No')

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
import sys


def main():
    [n, s] = [x for x in sys.stdin]
    n = int(n)
    if n % 2 != 0:
        print("No")
        return

    half = int(n / 2)

    if s[:half] == s[half:]:
        print("Yes")
        return

    print("No")


main()


import sys


def main():
    [n, s] = [x for x in sys.stdin]
    n = int(n)
    if n % 2 != 0:
        print("No")
        return

    half = int(n / 2)

    if s[0:half] == s[half:n]:
        print("Yes")
        return

    print("No")


main()


Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
N = int(input())
S  = list(input())
if len(S)%2 == 1:
    print('NO')
    exit()
if len(S)%2 == 0:
    for i in range(len(S)//2):
        if S[i] != S[i+len(S)//2]:
            print('NO')
            exit()
print('YES')

N = int(input())
S  = list(input())
if len(S)%2 == 1:
    print('No')
    exit()
if len(S)%2 == 0:
    for i in range(len(S)//2):
        if S[i] != S[i+len(S)//2]:
            print('No')
            exit()
print('Yes')

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
a=input()
if len(a)/2==1:
  print("No")
else:
  S=""
  N=len(a)/2
  for i in range(int(N)):
    S+=a[i]
    
  if S+S==a:
    print("Yes")
  else:
    print("No")

n=input()
a=input()
if int(n)%2==1:
  print("No")
else:
  S=""
  N=len(a)/2
  for i in range(int(N)):
    S+=a[i]
  if S+S==a:
    print("Yes")
  else:
    print("No")

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n=int(input())
s=input()

if n%2==0:
    c=n//2
    if(s[c:] == s[:c]):
        print('yes')
    else:
        print('no')
else:
    print('no')

n=int(input())
s=input()

if n%2==0:
    c=n//2:
    if(s[c:] == s[:c]):
        print('yes')
    else:
        print('no')
else:
    print('no')

n = int(input())
s = input()

if len(s)%2 == 1:
    print("No")
elif s[:len(s)//2] == s[len(s)//2:]:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
a = [ input() for i in range(n)]
n = int(a[0])
s = a[0]
if n % 2 == 1:
  print("No")

if s[0:n/2] == s[n/2:]:
  print("Yes")
else:
  print("No")


n = int(input())
s = input()
if n % 2 == 1:
  print("No")

if s[0:n/2] == s[n/2:]:
  print("Yes")
else:
  print("No")


n = int(input())
s = input()
if n % 2 == 1:
  print("No")

if s[0:s/2] == s[s/2:]:
  print("Yes")
else:
  print("No")


a = [ input() for i in range(2)]
n = int(a[0])
s = a[0]
if n % 2 == 1:
  print("No")

if s[0:n/2] == s[n/2:]:
  print("Yes")
else:
  print("No")


n = int(input())
s = input()
if n % 2 == 1:
  print("No")
else:
	if s[0:n//2] == s[n//2:]:
  		print("Yes")
	else:
  		print("No")


Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
a = int(input())
s = input()

if s[0:int(a/2)] == s[int(a/2):a]:
    print('yes')
else:
    print('no')

a = int(input())
s = input()

if s[0:int(a/2)] == s[int(a/2):a]:
    print('Yes')
else:
    print('No')


Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
b=list(input().encode("ascii"))
if(len(b) % 2 == 1):
  print('No')
else:
  c=0
  a=len(b)//2
  for i in range(0,a):
    if(b[i]!=b[i+a]):
        c=c+1
  if(c==0):    
   print('Yes')
  else:
    print('No')

N=input()
b=input()
g=list(b)
d=list(b.encode("ascii"))
if(len(d) % 2 == 1):
  print('No')
else:
  c=0
  a=len(d)//2
  for i in range(0,a):
    if(d[i]!=d[i+a]):
        c=c+1
  if(c==0):    
   print('Yes')
  else:
    print('No')

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n=input("enter")
if (len(n)%2==1):
	print("No")
else:
	if (n[0:len(n)//2] == n[len(n)//2:]):
		print("Yes")
	else:
		print("No")

n = int(input())
p = int(n/2)
c = input()
if(n % 2 is 0):
    if(c[:p] == c[p:]):
        print("Yes")
        exit
print("No")



n=int(input())
s=input()
if n%2==0:
  i=int(n/2)
  s1=s[:i]
  s2=s[i:]
  if s1==s2:
    print("Yes")
  else:
    print("No")
else:
  print("No")

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n=int(input())
s=list(input())
Len=len(s)/2
if len(s)%2==1:
  print('No')
else:
  for i in range(Len):
    if s[i]!=s[i+Len]:
      print('No')
      break
  print('Yes')

n=int(input())
s=list(input())
Len=int(len(s)/2)
if len(s)%2==1:
  print('No')
else:
  for i in range(Len):
    if s[i]!=s[i+Len]:
      print('No')
      exit()
  print('Yes')



Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
a = int(input())

s = string(input())

if a % 2 == 1:
  print("No")
else:
  b = int(a/2)
  if s[:b] == s[b:]:
    print("Yes")
  else:
    print("No")

a = int(input())

s = string(input())

if a % 2 == 1:
  print("No")
else:
  b = a/2
  if s[:b] == s[b:]:
    print("Yes")
  else:
    print("No")

a = int(input())

s = str(input())

if a % 2 == 1:
  print("No")
else:
  b = int(a/2)
  if s[:b] == s[b:]:
    print("Yes")
  else:
    print("No")

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
N , S = [input() for i in range(2)]
N = int(N)

if N == 1:
    o = N
else:
    o = int(N / 2)

o += 1

for i in range(o):
    T = S[0:i]
    T = T + T

    if i != 0 and T in S:
        print('YES')
        break
else:
    print('NO')

N , S = [input() for i in range(2)]
N = int(N)

o = int(N / 2)

if N % 2 == 1:
    print("No")

elif S[0:o] + S[0:o] in S:
    print('Yes')
else:
    print('No')

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
N = int(input())
S = input()

if N % 2 == 1:
    print("No")
    exit()

if S[0:N/2] == S[N/2:]:
    print("Yes")
else:
    print("No")

N = int(input())
S = input()

if N % 2 == 1:
    print("No")
    exit()

if S[0:int(N/2)] == S[int(N/2):]:
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
//不正解

n = int(input())
s = input()
x = int(n/2)

if n%2 != 0:
    print("No")
elif s[:x] == s[x+1:]:
    print("Yes")
else:
    print("No")



n = int(input())
s = input()
x = int(n/2)

if n%2 != 0:
    print("No")
elif s[:x] == s[x:]:
    print("Yes")
else:
    print("No")


Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n=int(input())
s=list(input())
c=0
for i in range(n//2):
    if s[i]!=s[i+n//2]:
        c+=1
if c==0:
    print('Yes'):
else:
    print('No')

n=int(input())
s=list(input())
c=0
if n%2 != 0:
    print('No')
    exit()
else:
    for i in range(n/2):
        if s[i]!=s[i+n/2]:
            c+=1
    if c==0:
        print('Yes')
    else:
        print('No')

n=int(input())
s=list(input())
c=0
if n%2 != 0:
    print('No')
    exit()
else:
    for i in range(n//2):
        if s[i]!=s[i+n//2]:
            c+=1
    if c==0:
        print('Yes')
    else:
        print('No')

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = int(input())
s = str(input())
t = s[:n//2]
u = s[n//2::]
print(s)
if t == u:
    print("Yes")
else:
    print("No")

n = int(input())
s = str(input())
t = s[:n//2]
u = s[n//2::]
if t == u:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = str(input())
t = n[:len(n)//2:]
if n == t + t:
    print('Yes')
else:
    print('No')

n = int(input())
s = str(input())
t = s[:n//2:]
if s == t + t:
    print('Yes')
else:
    print('No')

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
N = int(input())
S = int(input())
if N % 2 != 0:
    print("No")
else:
    arr = list(S)
    s_len = len(arr) // 2
    if arr[s_len:] == arr[:s_len]:
        print("Yes")
    else:
        print("No")


N = int(input())
S = input()
if N % 2 != 0:
    print("No")
else:
    arr = list(S)
    s_len = len(arr) // 2
    if arr[s_len:] == arr[:s_len]:
        print("Yes")
    else:
        print("No")


Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
N=int(input())
s=input()
if N%2==1:
  print("No")
else:
  for i in range(N):
    if s[i]!=s[N-i-1]:
      print("No")
      return(0)
  print("Yes")

N=int(input())
s=input()
if N%2==1:
  print("No")
else:
  b=1
  for i in range(N//2):
    if s[i]!=s[N//2+i]:
      print("No")
      b=0
      break
      
  if b==1:
  	print("Yes")

Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
A = input()
AA = A[0:int(len(A)/2)]
BB = A[int(len(A)/2):]
if AA == BB:
    print('Yes')
else:
    print('No')

N = input()
A = input()
AA = A[0:int(N/2)]
if A == (AA+AA):
    print('Yes')
else:
    print('No')

A = input()
AA = A[0:int(len(A)/2)]
if A == (AA+AA):
    print('Yes')
else:
    print('No')

N = int(input())
A = input()
AA = A[0:int(N/2)]
if A == (AA+AA):
    print('Yes')
else:
    print('No')

Verdicts: Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
N = int(input())
S = input()
if N%2==1:
    print('No')
else:
    a = S[:N//2]
    b = S[N//2:]
    print(a,b)
    if a==b:
        print('Yes')
    else:
        print('No')
    

N = int(input())
S = input()
if N%2==1:
    print('No')
else:
    a = S[:N//2]
    b = S[N//2:]
    if a==b:
        print('Yes')
    else:
        print('No')
    

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
a=int(input())
b=input()
if b[0:a//2-1]==[a//2:a-1]:
  print('Yes')
else:
  print('No')

a=int(input())
b=input()
if b[0:a//2]==b[a//2:]:
  print('Yes')
else:
  print('No')

Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n=int(input())
s=str(input())
if n%2==1:
  print("No")
else:
  s1=s[0:int(n/2):1]
  s2=s[int(n/2):n:1]
  print(s1,s2)
  if s1==s2: 
    print("Yes")
  else:
    print("No")

n=int(input())
s=str(input())
if n%2==1:
  print("No")
else:
  s1=s[0:int(n/2):1]
  s2=s[int(n/2)+1:n:1]
  if s1==s2: 
    print("Yes")
  else:
    print("No")

n=int(input())
s=str(input())
if n%2==1:
  print("No")
else:
  s1=s[0:int(n/2):1]
  s2=s[int(n/2):n:1]

  if s1==s2: 
    print("Yes")
  else:
    print("No")

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
if N % 2 != 0:
    print("No")
else:
    sa = S[:(N//2)]
    sb = S[(N//2):]

    if sa == sb:
        print("Yes")
    else:
        print("No")

N = int(input())
S = input()

if N % 2 != 0:
    print("No")
else:
    sa = S[:(N//2)]
    sb = S[(N//2):]

    if sa == sb:
        print("Yes")
    else:
        print("No")

Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n=int(input())
s=input()
if len(s) % 2 != 1:
  print("No")
for i in range(n):
  if s[:len(s)+1]==s[len(s)+1:]:
    print("Yes")
  else:print("No")

n=int(input())
s=input()
if len(s) % 2 == 1:
  print("No")
elif s[:len(s)//2]==s[len(s)//2:]:
  print("Yes")
else:print("No")

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = int(input())
s = input()

if n % 2 != 0:
  print('No')
else:
  if s[:n-1] == s[n:]:
    print('Yes')
  else:
    print('No')


n = int(input())
s = input()

if n % 2 != 0:
  print('No')
else:
  if s[:int((n/2))] == s[int((n/2)):]:
    print('Yes')
  else:
    print('No')


Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
N = int(input())
A = str(input())

if (N % 2 == 0):
  if (A[0:N/2-1] == A[N/2:N-1]):
    print("Yes")
  else:
    print("No")
else:
  print("No")


N = int(input())
A = str(input())

if (N % 2 == 0):
  if (A[:N/2-1] == A[N/2:]):
    print("Yes")
  else:
    print("No")
else:
  print("No")


N = int(input())
A = str(input())

if (N % 2 == 0):
  if (A[:N/2] == A[N/2:]):
    print("Yes")
  else:
    print("No")
else:
  print("No")


N = int(input())
A = str(input())

if (N % 2 == 0):
  if (A[:N/2-1] == A[N/2:N-1]):
    print("Yes")
  else:
    print("No")
else:
  print("No")

N = int(input())
A = str(input())

if (N % 2 == 0):
  print("True")
else:
  print("No")


N = int(input())
A = str(input())

if (N % 2 == 0):
  if (A[:N//2] == A[N//2:]):
    print("Yes")
  else:
    print("No")
else:
  print("No")


Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
N = int(input())
S = input()

if N % 2 == 0:
    num = int(N/2 + 1）
    string = S[:num]
    strstr = string + string
    if S == strstr:
        print("Yes")
    else:
        print("No")
else:
    print("No")


N = int(input())
S = input()

if N % 2 == 0:
  str = S[:N/2+1]
  strstr = str + str
  if S == str:
      print("Yes")
  else:
      print("No")
else:
  print("No")

N = int(input())
S = input()

if N % 2 == 0:
    num = int(N/2)
    string = S[:num]
    strstr = string + string
    if S == strstr:
        print("Yes")
    else:
        print("No")
else:
    print("No")


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
import math
n=int(input())
s=input()
s1=s[:n//2]
s2=s[n-(n//2):]
if n%2==0:
    print('No')
elif s1==s2:
    print('Yes')
else :
    print('No')

import math
n=int(input())
s=input()
s1=s[:int(n//2)]
s2=s[int(n//2):]
if n%2!=0:
    print('No')
elif s1==s2:
    print('Yes')
else :
    print('No')

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n=int(input())
s=input()
a=s[:n//2]
if s=a+a:
  print("Yes")
else:
  print("No")


n=int(input())
s=input()
a=s[:n//2]
if s==a+a:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
_,s=open(0);print('YNeos'[s[:len(s)//2]*2!=s::2])

n,s=open(0);print("YNeos"[s!=s[:int(n)//2]*2::2])

n,s=open(0);print('YNeos'[s[:int(n)//2]*2!=s::2])

n=int(input())
s=input()
print('YNeos'[s[:n//2]*2!=s::2])

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
N=int(input())
S=input()
n=len(S)
if n%2==0:
  T=S[0:n/2]
   if S==T+T:
     print("Yes")
   else:
     print("No")
else:
  print("No")

def main():
  N=int(input())
  S=input()
  n=len(S)
  if n%2==0:
    if all(S[i]==S[n/2+i] for i in range(n/2)):
      print("Yes")
    else:
      print("No")
  else:
    print("No")
 main()

def main():
  N=int(input())
  S=input()
  n=len(S)
  if n%2==0:
    half=S[0:n/2]
    if S=half+half:
      print("Yes")
    else:
      print("No")
  else:
    print("No")
main()
  

def main():
  N=int(input())
  S=input()
  n=len(S)
  if n%2!=0:
    print("No")
  if n%2==0:
    if all(S[i]==S[n/2+i] for i in range(n/2)):
      print("Yes")
    else:
      print("No")
 main()

def main()
  N=int(input())
  S=input()
  n=len(S)
  if n%2==0:
    if S[i]==S[n/2+i] for all(i in range(n/2)):
      print("Yes")
    else:
      print("No")
  else:
    print("No")
main()

def main()
  N=int(input())
  S=input()
  n=len(S)
  if n%2==0:
    if S[i]==S[n/2+i] for all(i in range(n/2)):
      print("Yes")
    else:
      print("No")
  else:
    print("No")
      

N=int(input())
S=input()
T=S[0:N//2]
if N%2==0:
  if S==T+T:
    print("Yes")
  else:
    print("No")
else:
  print("No")

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = int(input())

s = str(input())

if s[:(n//2)] == s[n:]:
  print("Yes")
else:
  print("No")

n = int(input())
 
s = str(input())
 
if s[:(n//2)] == s[n//2:]:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
N = int(input())
S = input()

if N % 2 == 0 and S[0:round(N / 2)] == S[round(N / 2) + 1:N - 1]:
    print('Yes')
else:
    print('No')

N = int(input())
S = input()

if N % 2 == 0 and S[0, N / 2] = S[N / 2, N - 1]:
    print('Yes')
else:
    print('No')

N = int(input())
S = input()

if N % 2 == 0 and S[0, N / 2] == S[N / 2 + 1, N - 1]:
    print('Yes')
else:
    print('No')

N = int(input())
S = input()

if N % 2 == 0 and S[0:N / 2] == S[N / 2 + 1:N - 1]:
    print('Yes')
else:
    print('No')

N = int(input())
S = input()

if N % 2 == 0 and S[0:round(N / 2)] == S[round(N / 2) + 1:N]:
    print('Yes')
else:
    print('No')

N = int(input())
S = list(map(input().split()))

if N % 2 == 0 and S[0:N / 2] == S[N / 2 + 1:N - 1]:
    print('Yes')
else:
    print('No')

N = int(input())
S = list(map(int, input().split()))

if N % 2 == 0 and S[0, N / 2] == S[N / 2 + 1, N - 1]:
    print('Yes')
else:
    print('No')

N = int(input())
S = input()

if N % 2 == 0 and S[0:round(N / 2)] == S[round(N / 2):N]:
    print('Yes')
else:
    print('No')

Verdicts: Wrong Answer

Runtime Error

Runtime Error

Runtime Error

Wrong Answer

Runtime Error

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = int(input())
s = input()
print("Yes" if n % 2 == 0 and s[:n/2] == s[n/2:] else "No")


n = int(input())
s = input()
print("Yes" if n % 2 == 0 and s[:int(n/2)] == s[int(n/2):] else "No")


Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = int(input())
s = input()
a = []
b = []
count = 1
for i in s:
  if count > (n/2):
    a.append(i)
  else:
    b.append(i)
  count += 1
print(a)
if a == b:
  print("Yes")
else:
  print("No")

n = int(input())
s = input()
a = []
b = []
count = 0
for i in s:
  if count > (n//2):
    a.append(i)
  else:
    b.append(i)
  count += 1
if a == b:
  print("Yes")
else:
  print("No")

n = int(input())
s = input()
a = []
b = []
count = 0
for i in s:
  if count > (n//2) + 1:
    a.append(i)
  else:
    b.append(i)
  count += 1
if a == b:
  print("Yes")
else:
  print("No")

l = int(input())
s = input()
h = l // 2
if l % 2 == 1:
  print("No")
else:
  flag = True
  for i in range(0, h):
    if s[i] != s[i + h]:
      flag = False
      break
  if flag:
    print("Yes")
  else:
    print("No")

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
a = input()
if len(a) % 2 == 1:
     print('No')
elif ''.join(list(a)[0:int(len(a)/2)]) == ''.join(list(a)[int(len(a)/2):]):
    print('Yes')
else:
    print('No')

s = int(input())
a = input()
if s % 2 == 1:
     print('No')
elif ''.join(list(a)[0:int(len(a)/2)]) == ''.join(list(a)[int(len(a)/2):]):
    print('Yes')
else:
    print('No')

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
t = str(input())

tLen = len(t)
tLenHalf = int(tLen / 2)

if (tLenHalf == 1):
	print("No")
else:
    if (t[:tLenHalf] == t[tLenHalf:]):
    	print("Yes")
    else:
    	print("No")

n = int(input())
t = str(input())

if (n !== len(t)): print("No")
else:
	nHalf = int(n / 2)

	if (nHalf == 1):
		print("No")
	elif (n == 0):
		print("No")
	else:
	    if (t[:nHalf] == t[nHalf:]):
	    	print("Yes")
	    else:
	    	print("No")

n = int(input())
t = str(input())

if (n != len(t)):
	print("No")
else:
	nHalf = int(n / 2)

	if (nHalf == 1 and n != 2):
		print("No")
	elif (n == 0):
		print("No")
	else:
		if (t[:nHalf] == t[nHalf:]):
			print("Yes")
		else:
			print("No")

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = int(input())
s = list(str(input()))
for i in range(n/2):
  if s[i] != s[int(n/2)+i]:
    print('No')
    exit()
print('Yes')

n = int(input())
s = list(str(input()))
if n == 1:
  print('No')
  exit()
for i in range(int(n/2)):
  print(i)
  if s[i] != s[int(n/2+i)] or n%2:
    print('No')
    exit()
print('Yes')

n = int(input())
s = list(str(input()))
for i in range(int(n/2)+1):
  if s[i] != s[int(n/2+i)] or n==1 or n%2:
    print('No')
    exit()
print('Yes')

n = int(input())
s = list(str(input()))
if n == 1:
  print('No')
  exit()
for i in range(int(n/2)):
  if s[i] != s[int(n/2+i)] or n%2:
    print('No')
    exit()
print('Yes')



Verdicts: Runtime Error

Wrong Answer

Runtime Error

Accepted