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):
input_str = input()
str_len = len(input_str)
if(str_len % 2 == 0 and input_str[:str_len/2] == input_str[str_len/2:str_len-1]):
  print("Yes")
else:
  print("No")

input_str = input()
str_len = len(input_str)
if(str_len % 2 == 0 && input_str[:str_len/2] == input_str[str_len/2:str_len-1]):
  print("Yes")
else:
  print("No")

str_len,input_str = map(str, str(input()).split('\n'))
half = int(int(str_len)/2)
if(str_len % 2 == 0 and input_str[0:half] == input_str[half:str_len]):
  print("Yes")
else:
  print("No")

input_str = input()
str_len = len(input_str)
if(len % 2 == 0 && input_str[:str_len/2] == input_str[str_len/2:str_len-1]):
  print("Yes")
else:
  print("No")
  

input_str = str(input())
str_len = len(input_str)
half = int(str_len/2)
if(str_len % 2 == 0 and input_str[0:half] == input_str[half:str_len]):
  print("Yes")
else:
  print("No")

str_len,input_str = input().split('\n')
half = int(int(str_len)/2)
if(str_len % 2 == 0 and input_str[0:half] == input_str[half:str_len]):
  print("Yes")
else:
  print("No")

str_len,input_str = map(str, input().split())
half = int(int(str_len)/2)
if(str_len % 2 == 0 and input_str[0:half] == input_str[half:str_len]):
  print("Yes")
else:
  print("No")

str_len = int(input())
input_str = str(input())
half = int(int(str_len)/2)
if(str_len % 2 == 0 and input_str[0:half] == input_str[half:str_len]):
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

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()
if len(s)%2==1:
    print('No')
else:
    ok=1
    mid=len(s)//2
    for i in range(mid):
        if s[i]!=s[mid]:
            ok=0
            break
    if ok:
        print('Yes')
    else :
        print('No')


n=int(input())
s=input()
if len(s)%2==1:
    print('No')
else:
    ok=1
    mid=len(s)//2
    for i in range(mid):
        if s[i]!=s[mid+i]:
            ok=0
            break
    if ok:
        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()
cnt= 0

if n%2 == 0:
  for i in range(len(s)/2):
    if s[i] == s[-1-i]:
      cnt += 1
  if n/2 == cnt:
    print("Yes")
  else:
    print("No")
else:
  print("No")
    

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

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

n = int(input())//2
s = input()
 
if s[:n] == s[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()
Flag = True
if N % 2 == 1:
  Flag = False
for i in range(0,N+1):
  if Flag == True and S[i] != S[i+N/2] :
    Flag = False
if Flag == True:
  print('Yes')
else:
  print('No')

N = int(input())
S = input()
Flag = True
if N % 2 == 1:
  Flag = False
else:
  for i in range(0,int(N/2)):
    a = S[i]
    b = S[int(i+(N/2))]
    if a != b :
      Flag = False
if Flag == True:
  print('Yes')
elif Flag == False:
  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()
n = len(s)
if n%2==1 or s[:n//2]==s[n//2:]:
    print("No")
else:
    print("Yes")
return 0

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

s = input()
if len(s)%2==1 or s[:len(s)//2]==s[len(s)//2:]:
    print("No")
else:
    print("Yes")
return 0

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

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

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

Verdicts: Runtime Error

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()
print(["No","Yes"][s[:int(n/2)]]==s[int(n/2):])

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

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()
s1 = list()
s2 = list()
if N % 2 == 1:
    print("No")
else:
    for i in range(N//2):
        s1.append(S[i])
    for i in range(N//2+1,N):
        s2.append(S[i])
    if s1 == s2:
        print("Yes")
    else:
        print("No")

N = int(input())
S = input()
s1 = list()
s2 = list()
if N % 2 == 1:
    print("No")
else:
    for i in range(N//2):
        s1.append(S[i])
    for i in range(N//2,N):
        s2.append(S[i])
    if 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=input()
if n%2!=0:
  print("No")
else:
  if n[:n//2]==n[n//2:]:
    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: 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 and s[:n / 2] == s[n / 2:]:
  print("Yes")
else:
  print("No")

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

if n % 2 == 0 and 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=int(input())
s=str(input())
if s[:n//2]==s[n//2:]:
  print("Yes")
 else:
  print("No")

n=int(input())
s=str(input())
if n%2!=0:
    print("No")
else:
    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 = int(input())
S = input()
n = N // 2
T  = S[:n - 1]
if S == T + T:
    print("Yes")
else:
    print("No")



N = int(input())
S = input()
n = N // 2
T  = S[:n]
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())
before = ""
after = ""
if N % 2 != 0:
  print("No")
else:
  for i in range N//2:
  	before += S[i]
  for j in range(N//2, N):
    after += S[j]
  if before == after:
    print("Yes")
  else:
    print("No")
    

N = int(input())
S = list(input())
before = ""
after = ""
if N % 2 != 0:
  print("No")
else:
  for i in range(N//2):
  	before += S[i]
  for j in range(N//2, N):
    after += S[j]
  if before == after:
    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 == 0):
  print(s[0:n // 2], s[n // 2: n])
  if(s[0:n // 2] == s[n // 2: n]):
    print("Yes")
    exit()
print("No")

n = int(input())
s = input()
if(n % 2 == 0):
  if(s[0:n // 2] == s[n // 2: n]):
    print("Yes")
    exit()
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())

n = int(N/2)
m = N-n
print(m)
if n == m:
  if A[:n] == A[n:]:
    print('Yes')
  else:
    print('No')
else:
  print('No')

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

n = int(N/2)
m = N-n
if n == m:
  if A[:n] == A[n:]:
    print('Yes')
  else:
    print('No')
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:
    first = S[:int(N/2)]
    second = S[int(N/2):]
    print(first)
    print(second)

    if first == second:
        print("Yes")
    else:
        print("No")


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

if N % 2 != 0:
    print("No")
else:
    first = S[:int(N/2)]
    second = S[int(N/2):]

    if first == second:
        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()
count = 0
print(n)
if n%2==1:
    print("No")
else:
    for i in range(n//2):
        #print(s[i], s[n//2+i])
        if s[i]!=s[n//2+i]:
            count = 1
    if count == 0:
        print("Yes")
    else:
        print("No")


n = int(input())
s = input()
count = 0
#print(n)
if n%2==1:
    print("No")
else:
    for i in range(n//2):
        #print(s[i], s[n//2+i])
        if s[i]!=s[n//2+i]:
            count = 1
    if count == 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 = int(input())
s = input()
t = n/2
for i in range(n-1):
  if s[:int(n/2)]==s[int(n/2):]:　
	  ans = ('Yes')
  else:
	  ans = ('No')
print(ans)

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

if n % 2 != 0: 
  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):
N = int(input())
S = list(input())

l = N//2
scr = 0
for i in range (l):
  if S[i] == S[l+i]:
    scr +=1
    #print("YES")
  else:
    scr -=100
    #print("NO")
if scr >0 :
  print("Yes")
else:
  print("No")
print(l)


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

l = N//2
if S[:l] == S[l:]:
  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

#input
N = int(input())
S = str(input())

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

import sys
input = sys.stdin.readline

#input
N = int(input())
S = str(input())

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

import sys
input = sys.stdin.readline

#input
N = int(input())
S = str(input())

#output
T = S[0:(N//2)]

if T + T == S:
    print("Yes")
else:
    print("No")

import sys
input = sys.stdin.readline
 
#input
N = int(input())
S = str(input())
 
#output
if N % 2 == 1:
    print("No")
elif N % 2 == 0:
    M = int(N/2)
    T = S[:M]
    U = S[M:]
    if T == U:
        print("Yes")
    else:
        print("No")

import sys
input = sys.stdin.readline

#input
N = int(input())
S = str(input())

#output
if N % 2 == 1:
    print("No")
elif N % 2 == 0:
    T = S[0:int(N/2)]
    U = S[int(N/2):]
    if T + T == S:
        print("Yes")
    else:
        print("No")

import sys
input = sys.stdin.readline

#input
N = int(input())
S = str(input())

#output
if N % 2 == 1:
    print("No")
elif N % 2 == 0:
    M = int(N/2)
    T = S[:M]
    U = S[M:]
    if T == U:
        print("Yes")
    else:
        print("No")


import sys
input = sys.stdin.readline

#input
N = int(input())
S = str(input())

#output
if N % 2 == 1:
    print("No")
elif N % 2 == 0:
    T = S[0:int(N/2)]
    U = S[int(N/2):]
    if T == U:
        print("Yes")
    else:
        print("No")

import sys
input = sys.stdin.readline
 
#input
N = int(input())
S = str(input())
 
#output
if N % 2 == 1:
    print("No")
elif N % 2 == 0:
    M = N//2
    T = S[:M]
    U = S[M:]
    if T == U:
        print("Yes")
    else:
        print("No")

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

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

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 = list(input())
print(S)

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

i = N/2-1

if S[:int(i)] == S[int(i+1):int(N-1)]:
    print("Yes")
else:
    print("No")

N = int(input())
S = list(input())
i = N/2

if N % 2 != 0:
    print("No")
    exit()
if S[:int(i)] == S[int(i):]:
    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(S[:int(N / 2)] == S[int(N / 2):]):
    print("YES")
else:
    print("NO")

N = int(input())
S = input()
 
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())
s = input()
s = [a for a in s]
if len(s) == 1:
    print("No")
    exit()
if s[:n/2] == s[n/2:]:
    print("Yes")
else:
    print("No")


n = int(input())
s = input()
l = [a for a in s]
if len(l)%2 == 1:
    print("No")
    exit()
n2 = int(n/2)
if "".join(l[:n2]) == "".join(l[n2:]):
    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
N = int(input())
S = input()
l = len(S)
if l % 2 != 0:
    print('No')
    sys.exit(0)
h  = l // 2
print(h)
if S[:h] == S[h:]:
    print('Yes')
    sys.exit(0)
print('No')


import sys
N = int(input())
S = input()
l = len(S)
if l % 2 != 0:
    print('No')
    sys.exit(0)
h  = l // 2
if S[:h] == S[h:]:
    print('Yes')
    sys.exit(0)
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[:n//2] == s[n//2:]:
  print("YES")
else:
  print("NO")

n=int(input())
s=input()
if n%2==0 and 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 s[:int(n/2)] == s[int(n/2):n] :
    print("Yes")
else
    print("No")

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

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

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

n = int(input())
s = input()
if s[:int(n/2)] == s[int(n/2):n] :
    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):
N = int(input())
S = input()

if (N % 2 == 0):
    c = int(N / 2)

    n = 0
    for x in range(c):
        if S[x] == S[x + c]:
            n += 1 

    if n == c:
        print('YES')  
    else: 
        print('NO')
        
else:
    print('NO')

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

if (N % 2 == 0):
    c = int(N / 2)

    n = 0
    for x in range(c):
        if S[x] == S[x + c]:
            n += 1 

    if n == c:
        print('YES')  
    else: 
        print('NO')
        
else:
    print('NO')

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

if (N % 2 == 0):
    c = int(N / 2)

    n = 0
    for x in range(c):
        if S[x] == S[x + c]:
            n += 1 

    if n == c:
        print('YES')  
    else: 
        print('NO')
        
else:
    print('NO')


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

if (N % 2 == 0):
    c = int(N / 2)

    n = 0
    for x in range(c):
        if S[x] == S[x + c]:
            n += 1 

    if n == c:
        print('Yes')  
    else: 
        print('No')
        
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):
N=int(input())
S=input()
c=0
for i in range(N):
  if i<=N/2-1 and S[i]==S[N-1-i]:
    c+=1
if c==N/2:
  print("Yes")
else:
  print("No")
  

N=int(input())
S=input()
c=0
for i in range(int(N/2)):
  if S[i]==S[N-1-i]:
    c+=1
if c==N/2:
  print("Yes")
else:
  print("No")
  

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

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 = input()

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


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

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

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

if n % 2 != 0:
    print('No')
else:
    t = s[0:int(n / 2)]
    if t * 2 == s:
        print('Yes')
    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):
n = int(input())
if(n%2==1):
  print("No")
else:
  s = input()
  a = s[:n/2]
  b = s[n/2:]
  if(a==b):
    print("Yes")
  else:
    print("No")

n = int(input())
s = input()
#print(n,s)
if(n%2==1):
  print("No")
else:
  a = s[:n//2]
  b = s[n//2:]
  if(a==b):
    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())
if(N % 2 != 0):
    print("no")

S = str(input())

char_list = list(S)

a = str(char_list[0])
n = int(N / 2)
b = str(char_list[n])

for i in range(1,n):
    a = str(a + char_list[i])
    b = str(b + char_list[i + n])

if(a == b):
    print("yes")
elif(a != b):
    print("no")


N = int(input())

S = str(input())

char_list = list(S)

a = str(char_list[0])
n = int(N / 2)
b = str(char_list[n])

for i in range(1,n):
    a = str(a + char_list[i])
    b = str(b + char_list[i + n])

if((a == b) and (N % 2 == 0)):
    print("Yes")
elif((a != b) or (N % 2 != 0)):
    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()
count =int(a/2)
bf = b[:count]
bb = b[count:]
if a %2==0 and bf == bb:
    print('yes')
else:
    print('no')

a = int(input())
b = input()
count =int(a/2)
bf = b[:count]
bb = b[count:]
if bf == bb:
    print('yes')
else:
    print('no')

a = int(input())
b = input()
count =int(a/2)
bf = b[:count]
bb = b[count:]
if a %2==0 and bf == bb:
    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

N = int(input())
S = list(str(input()))

if(N%2==1 or N==0):
    print("No")
    sys.exit()

if(N==2 and S[0]!=S[1]):
    print("No")
    sys.exit()
else:
    print("Yes")

for x in range(0, N//2-1):
    if(S[x]!=S[N//2+x]):
        print("No")
        sys.exit()

print("Yes")

import sys
 
N = int(input())
S = list(str(input()))
 
if(N%2==1 or N==0):
    print("No")
    sys.exit()
 
if(N==2 and S[0]!=S[1]):
    print("No")
    sys.exit()
 
for x in range(0, N//2-1):
    if(S[x]!=S[N//2+x]):
        print("No")
        sys.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):
n=int(input())
li=list(input())
t=n/2
if t%1:
  a=li[:t]
  b=li[:-t]
  for (i,j) in zip(a,b):
    if i==j:
    else:
      print('No')
      break
    print('Yes')
else:
  print('No')

n=int(input())
li=list(input())
if n%2==0:
  t=int(n/2)
  print(t)
  a=li[:t]
  t=t-1
  b=li[:-t-1]
  if a==b:
    print('Yes')
  else:
    print('No')
else:
  print('No')

n=int(input())
li=list(input())
if n%2==0:
  t=int(n/2)
  a=li[:t]
  b=li[-t:]
  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):
N = int(input('N'))
S = input('S')

if S.count(S[0:int(N/2)]) > 1:
    print('Yes')
else:
    print('No')

N = int(input(''))
n = int(N / 2)
S = input('')
if S[:n] == S[n:]:
    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):
total = int(input())
s = input()
 
if total%2 == 1:
  print("No")
else:
  if(s[:total/2]==s[total/2:]):
    print("Yes")
  else:
      print("No")

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

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

total = int(input())
s = input()

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

total = int(input())
s = input()
 
if total%2 == 1:
  print("No")
else:
  if(s[:int(total/2)] == s[int(total/2):]):
    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()
T = list()
for i in range(int(N / 2)):
    t = S[i]
    T.append(t)
y = 0
n = 0
for i in range(int(N / 2), N):
    for k in range(int(N / 2)):
        if T[k] == S[i]:
            y += 1
        else:
            n += 1
if y == 4:
    print('Yes') 
else:
    print('No')       


N = int(input())
S = input()
T = list()
for i in range(int(N / 2), N):
    t = S[i]
    T.append(t)
y = 0
n = 0
for i, k in zip(T, S):
    if i == k:
        y += 1
    else:
        n += 1
if int(N % 2) != 0:
    print('No')
elif y == 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())
s = input()
if len(s)&1:
  print("No")
else:
  if s[0:len(s)//2]==s[len(s)//2-1:]:
    print("Yes")
  else:
    print("No")

n = int(input())
s = input()
if n&1:
  print("No")
else:
  if s[0: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):
S = input()
if len(S)%2 == 1:
  print("No")
elif S[:int(len(S)/2)]==S[int(len(S)/2):]:
  print("Yes")
else:
  print("No")

N = int(input())
S = input()
if len(S)%2 == 1:
  print("No")
elif S[:int(len(S)/2)]==S[int(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().strip())
s = input().strip()
print(s[:n//2],s[n//2:])
if n%2!=0:
    print("No")
elif s[:n//2]==s[n//2:]:
    print("Yes")
else:
    print("No")

n = int(input().strip())
s = input().strip()
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)
t=input()
T=list(t)

if T[0:3]==T[3:6]:
  print("Yes")
else:
  print("No")

n=int(input())
t=input()
T=list(t)

num=n/2

if T[0:num]==T[num:6]:
  print("Yes")
else:
  print("No")

n=int(input())
t=input()
T=list(t)

num=round(n/2)
 

if T[0:num]==T[num: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()
ans="NO"
if(N<2):
  ans="NO"
elif(N%2!=0):
  ans="NO"
else:
  middle = N/2
  T=S[0:int(N/2)]
  T2=S[int(N/2):]
  if(S==T+T2):
    ans ="YES"
print(ans)


N=int(input())
S=input()
ans="NO"
if(N<2):
  ans="NO"
elif(N%2!=0):
  ans="NO"
else:
  middle = N/2
  T=S[0:int(N/2)]
  if(S==T+T):
    ans ="YES"
print(ans)

N=int(input())
S=input()
ans="NO"
if(N<2):
  ans="NO"
elif(N%2!=0):
  ans="NO"
else:
  T=S[0:int(N/2)]
  T2=S[int(N/2):]
  if(S==T+T2):
    ans ="YES"
print(ans)

N=int(input())
S=input()
ans="NO"
if(N<2):
  print(ans)
middle = N/2
T=S[0:int(N/2)]
T2=S[int(N/2):]
if(T==T2):
  ans ="YES"
print(ans)

N=int(input())
S=input()
ans="NO"
if(N<2):
  print(ans)
else:
  middle = N/2
  T=S[0:int(N/2)]
  T2=S[int(N/2):]
  if(T==T2):
    ans ="YES"
    print(ans)

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

Verdicts: Wrong Answer

Wrong Answer

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):
# coding: utf-8
n = int(input())
s = input()
if n % 2:
	print('No')
else:
	if s[0:(n/2)] == s[(n/2):n]:
		print('Yes')
	else:
		print('No')

# coding: utf-8
n = int(input())
s = input()
if n % 2:
	print('No')
else:
	if s[0:int(n/2)] == s[int(n/2):n]:
		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 !== 0:
  print("No")
else:
  t = s[int(n/2) - 1]
  if t * 2 == s:
    print("Yes")
  else:
    print("No");
    


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

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

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

if n % 2 != 0:
  print("No")
else:
  t = s[:int(n/2)]
  if t * 2 == s:
    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 = list(str(input()))

p = []
for i in range(N/2):
    if S[i] != S[N/2+i]:
        print('No')
print('Yes')

N = int(input())
S = list(str(input()))

if N %2 == 1:
    print('No')
    exit()
for i in range(int(N//2)):
    if S[i] != S[N//2+i]:
        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 = str(input())

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

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

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

n = int(input())
s = str(input())
t = int(n/2)

if n%2==1:
  print('No')
else:
  if s[:t]==s[t:]:
    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):
 = int(input())
S = input()
if N % 2 != 0:
    print('No')
else:
    if S[N // 2:] == S[:N // 2]:
        print('Yes')
    else:
        print('No')

N = int(input())
S = input()
if N % 2 != 0:
    print('No')
else:
    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):
import sys
n=int(input())
s=input()
if len(s)%2==1:
    print('No')
    sys.exit()
if s[1:n//2+1]==s[n//2+1:0:-1]:
    print('Yes')
else:
    print('No')

N = int(input())
S = input()
print("Yes" if S[:N//2] == S[N//2:] 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):
s = str(input())
if s[:len(s)//2] == s[len(s)//2:]:
  print("Yes")
else:
  print("No")

n = int(input())
s = str(input())
if 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 = list(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 = list(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 = list(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 = list(input())
if N % 2 == 1:
    print('No')
elif S[:N//2] == S[N//2:]:
    print('Yes')
else:
    print('No')


Verdicts: 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):
def main():
    N = int(input())
    S = input()
    if (N % 2 == 1):
        print('No')
    else:
        mid = N // 2
        print('Yes' if (S[:mid-1] == S[mid:]) else 'No')
    return 0
    
if __name__ == '__main__':
    main()

def main():
    N = int(input())
    S = input()
    if (N % 2 == 1):
        print('No')
    else:
        mid = N // 2
        print('Yes' if (S[:mid] == S[mid:]) else 'No')
    return 0
    
if __name__ == '__main__':
    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 = input()
l = len(N)
if l % 2 == 1:
  ans = 0
else:
  ans = (S[:l//2] == S[l//2:])
if ans:
  print('Yes')
else:
  print('No')

import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    N = I()
    t = S()
    if N % 2 > 0:
        print('No')
        return
    if t[:N//2] == t[N//2:]:
        print('Yes')
    else:
        print('No')

main()



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%2==1:
  print('No')
else:
  print('Yes' if s[:n//2]==s[n//2:] else 'No')

n = int(input())
s = input()
if n%2==1:
  print('No')
else:
  m = n//2
  print('Yes' if s[:m]==s[m:] 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 = str(input())

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

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

if N % 2 != 0:
  print('No')

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

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

if N % 2 != 0:
  print('No')

wc = N / 2
wc1 = S[:wc]
wc2 = S[wc:]

if wc1 == wc2:
  print('Yes')

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

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

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

if N % 2 == 0:
    T = str(S[:N/2])
    if S == T + T:
        print('Yes')
    else:
      print('No')
else:
    print('No')

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

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


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

if N % 2 == 0:
    T = S[:int(N/2)]
    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):
s = input()
n = len(s)
if n%2 == 1:
	print("No")
else:
	if s[:n/2] == s[n/2:]:
		print("Yes")
	else:
		print("No")

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

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

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

m = input()
s = input()
n = len(s)
f = int(n/2)
if n%2 == 1:
	print("No")
else:
	if s[:f] == s[f:]:
		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:
  print('No')
elif S == S[0:N//2+1]*2 :
  print('Yes')
else:
  print('No')
  

N = int(input())
S = input()
if N%2 == 1:
  print('No')
elif S == S[0:N//2]*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):
a=int(input())
b=input()
if a%2!=0:
  print("No")
else:
  a/=2
  c=b[:a]
  d=b[a:]
  if c==d:
    print("Yes")
  else:
    print("No")

a=int(input())
b=input()
if a%2!=0:
  print("No")
else:
  a//=2
  c=b[:a]
  d=b[a:]
  if c==d:
    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 != 0:
    print("No")
if S[0:N/2] * 2 == S:
    print("Yes")
else:
    print("No")


N = int(input())
S = str(input())
if S[0:N * 0.5] * 2 == S:
    print("Yes")
else:
    print("No")


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


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


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


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


Verdicts: 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=input()
if n%2==1:
    print('No')
else:
    for i in range(len(s)//2):
        if s[i]==s[i+len(s)//2]:
            print('Yes')
        else:
            print('No')

n=int(input())
s=input()
k=0
if n%2==1:
    print('No')
else:
    for i in range(len(s)//2):
        if s[i]==s[i+len(s)//2]:
            k=1
        else:
            print('No')
            exit()
if k== 1:
    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):
N = int(input())
Mylist = list(input())
ANSlist = []
if N%2 == 1:
  print("No")
else: 
  for i in range(N/2):
    if Mylist[i] == Mylist[i + N/2]:
      ANSlist.append("Yes")
  if len(ANSlist) == N/2:
    print("Yes")

N = int(input())
Mylist = list(input())
ANSlist = []
if N%2 == 1:
  print("No")
else: 
    for i in range(int(N/2)):
        if Mylist[i] == Mylist[i + int(N/2)]:
            ANSlist.append("Yes")
    if len(ANSlist) == 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=list(input())

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


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

a=N//2
answer="Yes"

if N%2==1:
    print("No")
else:
    for i in range(a):
        if S[i]==S[i+a]:
            pass

        else:
            answer="No"
            break
    print(answer)

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[0:int(N/2)-1] == S[int(N/2)+1:]:
  print("Yes")
else:
  print("No")

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

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

Verdicts: Wrong Answer

Runtime Error

Accepted