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!=0):
    print('No')
else:
    a1=S[:N/2]
    a2=S[N/2:]
    if (a1==a2):
        print('Yes')

l = int(input())
s = input()

if s == s[:l//2] + s[:l//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):
def echo(n,s):
  if n % 2 != 0:
    pass
  else:
    if s[:int(n/2)] == s[int(n/2):]:
      return "yes"
  return "no"

print(echo(int(input()),input()))

def echo(n,s):
  if n % 2 != 0:
    pass
  else:
    if s[:int(n/2)] == s[int(n/2):]:
      return "Yes"
  return "No"

print(echo(int(input()),input()))


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:
    a = S[0;N/2]
    b = S[N/2;]
    if a == b:
        print("Yes")
    else:
        print("No")

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

if N % 2 != 0:
    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())
s = input()
print(s[:n/2]==s[n/2:] and n%2==0)


n = int(input())
s = input()
if(s[:n//2]==s[n//2:] and n%2==0):
    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())
a= input()
l=[]
x=[]
y=[]
if n%2!=0:
    print('No')
else:
    for i in range(len(a)):
        l.append(a[i])
    for i in range(n//2):
        x.append(a[i])
    for j in range(n//2,n):
        y.append(a[j])
    if x==y:
        print('yes')
    else:
        print('No')

n=int(input())
a= input()
l=[]
x=[]
y=[]
if n%2!=0:
    print('No')
else:
    for i in range(len(a)):
        l.append(a[i])
    for i in range(n//2):
        x.append(a[i])
    for j in range(n//2,n):
        y.append(a[j])
    if x==y:
        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()

le = len(s)
if le %2 != 0:
  print("No")
  exit()

st1 = s[:le//2]
st2 = s[le//2:]
if st1 == st2:
  print("yes")
else:
  print("No")
  exit()


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

le = len(s)
if le %2 != 0:
  print("No")
  exit()

st1 = s[:le//2]
st2 = s[le//2:]
if st1 == st2:
  print("Yes")
else:
  print("No")
  exit()


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

n = int(input())
s = input()
flag = 0
if n%2 == 0:
    m = int(n/2)
    for i in range(m):
        if s[i] != s[m+i]:
            flag = 1

    if flag == 1:
        print("No")
    else:
        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()

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


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


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

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

i=input()
S=input()
if S[:len(S)//2] != S[len(S)//2] or len(S)%2 !=0:
  print("No")
else:
  print("Yes")

i=input()
S=input()
if S[:len(S)//2] != S[len(S)//2:] or len(S)%2 !=0:
  print("No")
else:
  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:
  s1 = s[:n/2]
  s2 = s[n/2:]
  if s1 == s2:
    print("Yes")
  else:
    print("No")
else:
  print("No")

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

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

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

print("YNoes"[s[0:int(n/2)] != s[int(n/2):n]::2])


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

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


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(S[:int(N/2)] == S[int(N/2):])
else:
	print(false)

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

S = input()

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

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

N = int(N / 2)
if S[: N] == S[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=str(input())
if S[0:int(N/2)]==S[int(N/2):N]:
    print("yes")
else:
    print("no")

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

n = int(input())
s = input()
 
print('Yes' if s[:n//2] == s[n//2:] 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):
n=int(input())
hn=n//2
tx=input()
tx1=tx[:hn]
tx2=tx[hn:]
print(tx1,tx2)
if tx1==tx2:
    print("Yes")
else:
    print("No")

n=int(input())
hn=n//2
tx=input()
tx1=tx[:hn]
tx2=tx[hn:]
#print(tx1,tx2)
if tx1==tx2:
    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()
b = 0
if n % 2 == 0:
  b = 1
  for i in range(n/2):
    if S[i] != S[i+n/2]:
      b = 0
print("Yes" if b = 1 else "No")
  

import java.util.Scanner;

class Main {

  static boolean RS(String S, int n) {
    
    if (n%2 == 1) return false;
      
    for(int i = 0; i < n/2; i++)
      if(S.charAt(i)) != S.charAt(i+n/2))
        return false;
      
    return true;
  }
  
  public static void main(String[] args) {
    Scanner stdIn = new Scanner(System.in);
    
    int n = stdIn.nextInt();
    String S = stdIn.next();
     
    switch(RS(S, n)) {
     case true: System.out.println("Yes"); break;
     case false: System.out.println("No"); break;
    }
  }
}


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


import java.util.Scanner;

class Main {

  static boolean RS(String S, int n) {
    
    if (n%2 == 1) return false;
      
    for(int i = 0; i < n/2; i++)
      if(S.charAt(i) != S.charAt(i+n/2))
        return false;
      
    return true;
  }
  
  public static void main(String[] args) {
    Scanner stdIn = new Scanner(System.in);
    
    int n = stdIn.nextInt();
    String S = stdIn.next();
     
    if(RS(S, n))
      System.out.println("Yes");
    else
      System.out.println("No");
  }
}


import java.util.Scanner;

class Main {

  static boolean RS(String S, int n) {
    
    if (n%2 == 1) return false;
      
    for(int i = 0; i < n/2; i++)
      if(S.charAt(i)) != S.charAt(i+n/2))
        return false;
      
    return true;
  }
  
  public static void main(String[] args) {
    Scanner stdIn = new Scanner(System.in);
    
    int n = stdIn.next();
    String S = stdIn.next();
     
    switch(RS(S, n)) {
     case true: System.out.println("Yes"); break;
     case false: System.out.println("No"); break;
    }
  }
}


n = int(input())
s = input()
print("Yes" if s[:n//2] == s[n//2:] else "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:
  flag=0
  for i in range(len(S)):
    if S[i]!=S[i+(len(S)/2)]:
      flag=1
      break
  if flag==0:
    print("Yes")
  else::
    print("No")

n=int(input())
s=input()
if n%2==1:
  print("No")
else:
  for i in range(n//2):
    if s[i]!=s[i+(n//2)]:
      print("No")
      break
  else:
    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, S = map(string, input().split())
N = int(N)
if N % 2 > 0:
    print('No')
hN = N // 2
if S[:hN] == S[hN:N]:
    print('Yes')
else:
    print('No')

s = [input() for i in range(2)]
N = int(s[0])
S = s[1]
if N % 2 > 0:
    print('No')
hN = N // 2
if S[:hN] == S[hN:N -1]:
    print('Yes')
else:
    print('No')


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

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

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

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

n=int(input())
s=input()
if n%2==0:
    if s[0:n//2]==s[n//2:]:
        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,s = input().sprit()
n = int(n)

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

n,s = input().sprit()
n = int(n)
 
if n%2 == 0 :
	if s[:2/n-1] == s[2/n:]:
      print('Yes')
    else:
      print('No')
else:
	print('No')

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


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

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

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

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


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

print (N)

if(print (S[:(N//2)]) == print (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: 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):
row = input()
unit1, unit2 = row[:len(row)//2], row[len(row)//2:]
if unit1 == unit2:
    print('Yes')
else:
    print('No')

row = input()
if len(row) % 2 == 0:
    unit1, unit2 = row[:len(row)//2], row[len(row)//2:]
    if unit1 == unit2:
        print('Yes')
    else:
        print('No')
else:
    print('No')

N, row = input().split()
unit1, unit2 = row[:len(row)//2], row[len(row)//2:]
if unit1 == unit2:
    print('Yes')
else:
    print('No')

N = input()
row = input()
unit1, unit2 = row[:len(row)//2], row[len(row)//2:]
if unit1 == unit2:
    print('Yes')
else:
    print('No')

Verdicts: 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()
print('Yes'if s[:len(s)//2]==s[len(s)//2:] else 'No')
print(s[:len(s)//2], s[len(s)//2:])


n=int(input())
s=input()
print('Yes'if s[:len(s)//2]==s[len(s)//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):
n = int(input())
s = 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 = input()

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


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

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


n = int(input())
s = input()
 
print(type(s))
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")

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

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

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


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

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

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

print(S[:N//2]==S[N//2:])

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

half = int(N/2)

if S[:half] == S[half:]:
    print("True")
else:
    print("False")

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

half = int(N/2)

if S[:half] == S[half:]:
    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()
sub=(n/2)
if count(s[0:sub])==2:
  print(Yes)
else:
  print(No)

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


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

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


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


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


Verdicts: 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())

string = input()

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

#!/usr/bin/python3
# coding: utf-8


def I(): return int(input())


def IsIl(): return list(map(lambda x: int(x), input().split()))


def InIl(n): return [input() for i in range(n)]


def IsIt(): return map(lambda x: int(x), input().split())


def InIl(n): return map(input() for i in range(n))


def SsSl(): return list(map(lambda x: x, input()))




def SSd():
    from collections import defaultdict
    A = input() 
    dd=defaultdict(int)
    for a in A:
        dd[a]+=1
    return dd




# https://qiita.com/chun1182/items/ddf2b6cba932b2bb0d4e
n = int(input())

string = input()

if n%2 != 0:
  print('No')
else:
  if string[:int(n/2)] == string[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())
word = str([input() for i in range(n)])

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


n = int(input())
word = [input() for i in range(n)]

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

n = int(input())
temp_word = [input() for i in range(n)]
word = str(temp_word)

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


n = int(input())
word = [input() for i in range(n)]

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


n = int(input())
word = str(input())

num = int(n / 2)
if word[:num] == word[num:] :
	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):
len = int(input())
str = input()
flag = True

if len % 2 == 1:
  flag = False
else:
  for i in range(int(len/2)):
    if str[i] != str[i + int(len / 2)]:
      flag = False

if flag:
  print("yes")
else:
  print("no")

len = int(input())
str = input()

if len % 2 == 1:
  print("no")

flag = True
for i in range(int(len/2)):
  if str[i] != str[i + int(len / 2)]:
    flag = False

if flag:
  print("yes")
else:
  print("no")

len = int(input())
str = input()
flag = True

if len % 2 == 1:
  flag = False
else:
  for i in range(int(len/2)):
    print(str[i])
    print(str[i + int(len / 2)])
    if str[i] != str[i + int(len / 2)]:
      flag = False

if flag:
  print("Yes")
else:
  print("No")

len = int(input())
str = input()
flag = True

if len % 2 == 1:
  flag = False
else:
  for i in range(int(len//2)):
    if str[i] != str[i + int(len // 2)]:
      flag = False

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):
number = input(N)
word = list(input((S))
judge = 'Yes'
            
if N%2 == 1:
    print('No')
elif for i in range(N/2 - 1):
    if word[i] != word[N/2+i]:
        judge = 'No'

print(judge)            	
            		


number = input(N)
word = list(input((S))
judge = 'Yes'
            
if N%2 == 1:
    print('No')
elif for i in range(N/2):
    if word[i] != word[2i]:
        judge = 'No'

print(judge)            	
            		


number = int(input())
word = list(input())
judge = 'Yes'
            
if number%2 == 1:
	judge = 'No'
    
else:
	for i in range(int(number/2)):
		if word[i] != word[int(number/2 + i)]:
			judge = 'No'

print(judge)    

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

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

n = int(input())

if n%2 == 1:
    print("No")
else:
    s = list(input())
    s1 = s[:n//2]
    s2 = s[n//2:]
    if s1 == s2:
        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:
  s1 = s[:(n//2)]
  s2 = s[(n//2):]
  print(s1,s2)
  if s1 == s2:
    print("Yes")
  else:
    print("No")

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

n = int(input())
s = input()
if n % 2 == 1:
  print("No")
else:
  s1 = s[:(n//2)]
  s2 = s[(n//2):]
  if s1 == s2:
    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 = input()
if n % 2 == 0:
  end = n//
  start = end
else:
  end = n//2+1
  start = n//2
if s[:end] == s[start:]:
  print('Yes')
else:
  print('No')

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

n = int(input())
s = input()
if n % 2 == 0:
  end = n//2
  start = end
  if s[:end] == s[start:]:
    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 math
N = int(input())
S = str(input())

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

n = (N/2)
j = True


for i in range(n):
    if S[i] != S[i + n]:
        j = False

if j:
    print('Yes')
else:
    print('No')

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

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

n = math.ceil(N/2)
j = True

try:
    for i in range(n):
    if S[i] != S[i + n]:
        j = False
except:
    break

if j:
    print('Yes')
else:
    print('No')


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

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

n = (N/2)
j = True


for i in range(n):
    if S[i] != S[i + n]:
        j = False

if j:
    print('Yes')
else:
    print('No')


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

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

n = math.ceil(N/2)
j = True

if N%2 == 0:
    for i in range(n):
    if S[i] != S[i + n]:
        j = False
else:
    for i in range(n-1):
    if S[i] != S[i + n]:
        j = False

if j:
    print('Yes')
else:
    print('No')


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

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

n = (N//2)
j = True


for i in range(n):
    if S[i] != S[i + n]:
        j = False

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

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

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

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

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

if n%2!=0:
  print('No')
  exit()
x=int(n/2)
print('Yes') if s[:x]==s[x:] 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):
Source Code 

Copy
Copy
N = input()
S = str(input())
 
if N + 2 // 2 == 1:
  print('No')
 
else:
  f = int((N/2)-1)
  b = int(N/2)
  front = S[:f]
  back = S[b:]
  if front == back:
    print('Yes')
  else:
    print('No')

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

if N + 2 // 2 == 1:
  print('No')

else:
  f = int(N/2)
  b = int(N/2)
  front = S[:f]
  back = S[b:]
  if front == back:
    print('Yes')
  else:
    print('No')
    

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

if N + 2 // 2 == 1:
    print('No')

else:
    f = int(N/2)
    b = int(N/2)
    front = S[:f]
    back = S[b:]
    if front == back:
        print('Yes')
    else:
        print('No')
    
print(front)
print(back)

N = int(input())
S = str(input())
 
if N + 2 // 2 == 1:
    print('No')
 
else:
    f = int(N/2)
    b = int(N/2)
    front = S[:f]
    back = S[b:]
    if front == back:
        print('Yes')
    else:
        print('No')
    
#print(front)
#print(back)

Verdicts: 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):
import sys
N = int(input())
S = input()
if N%2 != 0:
    print("No")
    sys.exit()

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


import sys
N = int(input())
S = input()
if N%2 != 0:
    print("No")
    sys.exit()

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


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

S_pre = S[:N-1]
S_later = S[N:]
if S_pre == S_later:
    print("Yes")
else:
    print("No")


import sys
N = int(input())
S = input()

mid = int(N/2)
S_pre = S[:mid]
S_later = S[mid:]
#print(S_pre)
#print(S_later)
if S_pre == S_later:
    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):
N = int(input())
S = str(input())

if N % 2 == 0:
  NN = N/2
  for i in range(0, NN):
    if S[i] != S[i+NN]:
      print('No')
  else:
    print('Yes')
    
else:
  print('No')

N = int(input())
S = str(input())
 
if N % 2 == 0:
  NN = int(N/2)
  for i in range(0, NN):
    if S[i] != S[i+NN]:
      print('No')
      break
  else:
    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=input()
a=len(s)
if a%2==1:
  print("No")
else:
  b=a//2
  c=0
  for i in range(b):
    if s[i]!=s[i+b]:
      print("No")
      break
    else:
      c=c+1
  if c==b:
    print("Yes")

n=int(input())
s=input()
a=len(s)
if a%2==1:
  print("No")
else:
  b=a//2
  c=0
  for i in range(b):
    if s[i]!=s[i+b]:
      print("No")
      break
    else:
      c=c+1
  if c==b:
    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):
import sys
n = int(input())
s = input()
a = int(len(s)/2)

if(len(a)%2 == 1):
  print("No")
  sys.exit()

for i in range(a):
  if(s[i] != s[i + a]):
    print("No")
    sys.exit()
    
print("Yes")
    
    


import sys
n = int(input())
s = input()
d = int(n/2)
if(len(s)%2 == 1):
    print("No")
    sys.exit()
else:
    for i in range(d):
        if(s[i] != s[i + d]):
            print("No")
            sys.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 (s[:n/2] = s[n/2:]):
  print("Yes")
else:
  print("No")


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


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


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

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

N = int(input())
S = input()
print("Yes" if S[:N//2] == S[N//2:] else "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 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: 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:
  pirnt("No")
  exit()
  
half=n/2
print("Yes" if s[half:]+s[half:]==s else "No")

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

if n % 2:
  print("No")
  exit()

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

args=input()
a=args[0]
b=args[1]
print('Yes')

a,b=input().split()
print('Yes')

a,b=input().split('\n')
n=int(a/2)
s=b
print('Yes' if s[:n]==s[n:] else 'No')

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

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

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

half = n / 2

ans = "Yes" if s[:half] == s[half:] else "No"
print(ans)

a,b=input()
n=int(a)
s=b
half=int(n/2)
print(s[:half]==s[half:])

args=input().split()

n=int(args[0])
s=args[1]

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

a,b = input().split('\n')
n=int(a)
s=b

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

a,b=input().split()
n=int(a)/2
s=b
if n % 2:
  print('No')
elif s[n:]!=s[:n]:
  print('No')
else:
  print('Yes')

args=input()

n=int(args[0])
s=args[1]

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

args=input()
n=int(args[0])
s=args[1]
print('No' if n%2==1 else 'Yes')

a,b=input().split()
print('Yes')

a,b=input().split('\n')

a,b=input().split('\n')
print('Yes')

n,s=input().split()

a, b = input()
n=int(a/2)
s=b
s1=s[n:]
s2=s[:n]
bl=s1==s2
print('Yes' if bl else 'No')

args=input().split()
n=int(args[0])
s=args[1]

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

args=input().split()
n=int(args[0])
s=args[1]
print('No' if s[n:]!=s[:n] else 'Yes')

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

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

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

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

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

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

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

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

n=int(input())
a =input()
if len(a)%2!=0:
  print("NO")
else:
  if a[:len(a)//2]==a[len(a)//2:]:
    print("YES")
  else:
    print("NO")

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

S1 = S[:N/2]
S2 = S[N/2:]

if S1 == S2:
  print("Yes")
else:
  print("No")

N = int(input())



N,S = input().split()
 
S1 = S[:int(N)/2]
S2 = S[int(N)/2:]
 
if S1 == S2:
  print("Yes")
else:
  print("No")

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

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

t=int(int(N)/2)
letter1=S[0:t]
letter2=S[t:]
if letter1==letter2:
  print('YES')
else:
  print('NO')

N=input()
S=input()

t=int(int(N)/2)
letter1=S[:t]
letter2=S[t:]
if int(N)%2==1:
  print('NO')
else:
  if letter1==letter2:
    print('YES')
  else:
    print('NO')

N=int(input())
S=input()
t=int(N/2)
letter1=S[:t]
letter2=S[t:]
if N%2==1:
  print('NO')
else:
  if letter1==letter2:
    print('YES')
  else:
    print('NO')
    



N=input()
S=input()

t=int(int(N)/2)
letter1=S[0:t]
letter2=S[t:]
if int(N)%2==1:
  print('NO')
else:
  if letter1==letter2:
    print('YES')
  else:
    print('NO')

N=input()
S=input()

t=int(int(N)/2)
letter1=S[:t]
letter2=S[t:]
if int(N)%2==1:
  print('NO')
else:
  if letter1==letter2:
    print('YES')
  else:
    print('NO')

N=int(input())
S=input()
t=int(N/2)
s1=S[:t]
s2=S[t:]
if s1==s2:
  print('YES')
else:
  print('NO')
    



N = int(input())
S = input()
n = int(N/2)
s1 = S[:n]
s2 = S[n:]
if s1 == s2 :
    print('Yes')
else :
    print('No')


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

ans = 'Yes'

for i in (n // 2):
    if s[i] != s[i + (n // 2)]:
        ans = 'No'

print(ans)
        
        


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

ans = 'Yes'

for i in ((n // 2) - 1):
    if s[i] != s[i + (n // 2)]:
        ans = 'No'

print(ans)
        
        


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

ans = 'Yes'

if n % 2 != 0:
    ans = 'No'
    
for i in range(n // 2):
    if s[i] != s[i + (n // 2)]:
        ans = 'No'

print(ans)
        
        

Verdicts: Runtime Error

Runtime Error

Accepted