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

s1 = ""
s2 = ""

if(n % 2 == 0):
    for i, st in enumerate(string):
        if i < n/2:
            s1 = s1 + st
        else:
            s2 = s2 + st

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


n = int(input())
string = int(input())

s1 = ""
s2 = ""

if(n % 2 == 0):
    for i st in enumerate(string):
        if i < n/2:
            s1 = s1 + st
        else:
            s2 = s2 + st

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


n = int(input())
string = str(input())

s1 = ""
s2 = ""

if(n % 2 == 0):
    for i, st in enumerate(string):
        if i < n/2:
            s1 = s1 + st
        else:
            s2 = s2 + st

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

Verdicts: Runtime Error

Runtime Error

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

Submission attempts (in order):
lst = [input() for i in range(2)]

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

if n % 2 == 1:
    print('NO')

t = ''

for i in range(0, n//2):
    t += s[i]

if t + t == s:
    print('YES')
else:
    print('NO')


lst = [input() for i in range(0, 2)]

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

if n % 2 == 1:
    print('NO')

t = ''

for i in range(0, n//2):
    t += s[i]

if t + t == s:
    print('YES')
else:
    print('NO')


lst = (input().split())

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

if n % 2 == 1:
    print('NO')

t = s[0, n/2 + 1]

if t + t == s:
    print('YES')
else:
    print('NO')


lst = input().split()

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

if n % 2 == 1:
    print('NO')

t = ''

for i in range(0, n/2):
    t += s[i]

if t + t == s:
    print('YES')
else:
    print('NO')


lst = input()

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

if n % 2 == 1:
    print('NO')

t = ''

for i in range(0, n//2):
    t += s[i]

if t + t == s:
    print('YES')
else:
    print('NO')


lst = input().split()

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

if n % 2 == 1:
    print('NO')

t = ''

for i in range(0, n//2):
    t += s[i]

if t + t == s:
    print('YES')
else:
    print('NO')


lst = input().split()

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

if n % 2 == 1:
    print('NO')

t = s[0, n/2 + 1]

if t + t == s:
    print('YES')
else:
    print('NO')


lst = [input() for i in range(2)]

n = int(lst[0])
s = lst[1]
t = ''

for i in range(n//2):
    t += s[i]

if n % 2 == 1:
    print('No')
elif t + t == s:
    print('Yes')
else:
    print('No')


Verdicts: Wrong Answer

Wrong Answer

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 == 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")

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

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


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

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

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

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

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

Verdicts: 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 n%2==0 and s[:n//2+1]==s[n//2+1:]:
    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):
data_len = int(input())
data = input()
if data[0:int(data_len / 2)] == data[int(data_len / 2):data_len]:
    print("true")
else:
    print("false")

data_len = int(input())
data = input()
if data[0:int(data_len / 2)] == data[int(data_len / 2):data_len]:
    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())
list = list(input())
n = 0
if N % 2 != 0:
	print("No")
else:
    for i in range(N//2):
	    if not list[i] == list[i+ N//2]:
            print("No")
            break
        n += 1
    if n == N//2 - 1:
        print("Yes")


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


Verdicts: Runtime Error

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

Submission attempts (in order):
N = int(input())
S = input()
h = N/2
if S[0:h] == S[h:N]
	return Yes
return No

N = int(input())
S = input()
h = int(N/2)
if S[0:h] == S[h: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):
from sys import stdin
#from collections import deque
#from math import sqrt, floor, ceil, log, log2, log10, pi, gcd
def ii(): return int(stdin.readline())
def fi(): return float(stdin.readline())
def mi(): return map(int, stdin.readline().split())
def fmi(): return map(float, stdin.readline().split())
def li(): return [x for x in mi()]
def si(): return stdin.readline()
n=ii()
print(n*n)

from sys import stdin
#from collections import deque
#from math import sqrt, floor, ceil, log, log2, log10, pi, gcd
def ii(): return int(stdin.readline())
def fi(): return float(stdin.readline())
def mi(): return map(int, stdin.readline().split())
def fmi(): return map(float, stdin.readline().split())
def li(): return [x for x in mi()]
def si(): return stdin.readline()
z=['Yes', 'No']
n=ii()
f=n%2
a=si()
if not f:
    x=n//2
    for i in range(x):
        if a[i]!=a[i+x]:
            f=1
            break
print(z[f])

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()
s=input()
a=[]
b=[]
for i in range(len(s)//2):
    a.append(s[i])
for i in range(len(s)//2,len(s)):
    b.append(s[i])
print(a,b)
if a==b:
    print("Yes")
else:
    print("No")

n=input()
s=input()
a=[]
b=[]
for i in range(len(s)//2):
    a.append(s[i])
for i in range(len(s)//2,len(s)):
    b.append(s[i])
if a==b:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

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

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

N=int(input())
S=input()
f='sf'
s='fs'
if N%2==0 and N!=0:
    f,s=S[:int(N/2)], S[int(N/2):]
if f==s:
    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")
  return
for i in range(N/2):
  if S[i] != S[N/2 + i]:
    print("No")
    return
print("Yes")


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

if N % 2:
  print("No")
else:
  for i in range(N/2):
    if S[i] != S[N/2 + i]:
      print("No")
      return
  print("Yes")

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

ans = 1
if N % 2:
  ans = 0
else:
  for i in range(N//2):
    if S[i] != S[N//2 + i]:
      ans = 0
if ans:
  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):
str_num = input()
input_str = input()
input_array = list(input_str)

match_num = 0
int_str_num =int(str_num)

if int_str_num % 2 == 0:
  half_str_num = int_str_num/2
  int_half_str_num = int(half_str_num)
  for i in range(int_half_str_num):
    if input_array[i] == input_array[i+int_half_str_num]:
      match_num = match_num + 1
    
  if n == half_str_num:
    print('Yes')
  else:
    print('No')
else:
  print('No')
  



str_num = input()
input_str = input()
input_array = list(input_str)

n = 0
int_str_num =int(str_num)

if int_str_num % 2 == 0:
    half_str_num = int_str_num/2
    int_half_str_num = int(half_str_num)
    for i in range(int_half_str_num):
        if input_array[i] == input_array[i+int_half_str_num]:
            n = n + 1
    if n == half_str_num:
        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):
def SsSl(): return list(map(lambda x: x, input()))

n = int(input())
#List = [s for s in input().split()]
List = SsSl()

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

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

n = int(input())
#List = [s for s in input().split()]
List = SsSl()

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

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

n = int(input())
#List = [s for s in input().split()]
List = SsSl()

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

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

n = int(input())
#List = [s for s in input().split()]
List = SsSl()

if n%2==1:
    print("No")
else:
    if List[0:(n//2)]==List[(n//2):]:
        print("Yes")
    else:
        #print(List[0:(n/2)])
        #print(List[(n/2):])
        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):
I = [input() for i in range(2)]
sn = int(I[0])
ss = str(I[1])
if sn%2 == 1 :
    A = 'No' 
else:
    sl = int(sn/2) 
    if sl >= 2 : 
        H1 = ss[:sl]
        H2 = ss[sl+1:]
    elif sl == 1 :
        H1 = ss[0]
        H2 = ss[1]
    if  H1 == H2 :
        A = 'Yes'
    else:
        A = 'No'
print(A)

I = list(map(int,input().split()))
if I(0)%2 = 1 :
    A = 'No' 
else:
    H＝I(1)[:I 0)/2]
    if I(1) = H + H :
        A = 'Yes'
    else:
        A = 'No'

print(A)

I = [input() for i in range(2)]
if I(0)%2 = 1 :
    A = 'No' 
else:
    H1 = I(1)[:I(0)/2]
    H2 = I(1)[I(0)/2+1:]
    if  H1 = H2 :
        A = 'Yes'
    else:
        A = 'No'

print(A)

I = [input() for i in range(2)]
sn = int(I[0])
ss = str(I[1])
if sn%2 == 1 :
    A = 'No' 
else:
    sl = int(sn/2) 
    # print(sl)
    if sl >= 2 : 
        H1 = ss[:sl]
        H2 = ss[sl:]
    #     print(H1)
    #     print(H2)
    elif sl == 1 :
        H1 = str(ss[0])
        H2 = str(ss[1])
    if  H1 == H2 :
        A = 'Yes'
    else:
        A = 'No'
print(A)

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):
# -*- coding:utf-8 -*-

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

if n == 1:
	flag = 0
else:
	for i in range(n):
		if (s[:i] == s[i:]):
			print("YES")
			flag = 1
			exit()
		else:
			flag = 0

if flag == 0 :
	print("NO")

# -*- coding:utf-8 -*-

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

if n == 1:
	flag = 0
else:
	for i in range(n):
		if (s[:i] == s[i:]):
			print("Yes")
			flag = 1
			exit()
		else:
			flag = 0

if flag == 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):
def main():
    N = int(input())
    S = input()
    if N % 2 == 0:
        print("No")
        quit()
    yesno = "Yes" if S[:N / 2] == S[N / 2:] else "No"
    print(yesno)


if __name__ == "__main__":
    main()


def main():
    N = int(input())
    S = input()
    if N % 2 == 1:
        print("No")
        quit()
    yesno = "Yes" if S[:N / 2] == S[N / 2:] else "No"
    print(yesno)


if __name__ == "__main__":
    main()


def main():
    N = int(input())
    S = input()
    if N % 2 == 1:
        print("No")
        quit()
    n = N / 2
    yesno = "Yes" if S[:n] == S[n:] else "No"
    print(yesno)


if __name__ == "__main__":
    main()


import sys


def main():
    N = int(input())
    S = input()
    if N % 2 == 1:
        print("No")
        sys.exit()
    n = N / 2
    yesno = "Yes" if S[:n] == S[n:] else "No"
    print(yesno)


if __name__ == "__main__":
    main()


def main():
    N = int(input())
    S = input()
    if N % 2 == 1:
        print("No")
        quit()
    n = N // 2
    yesno = "Yes" if S[:n] == S[n:] else "No"
    print(yesno)


if __name__ == "__main__":
    main()


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

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

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

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

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

Verdicts: Wrong Answer

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

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

if N%2==0:
    for i in  range(0,int(N/2)):
        if S[i]!=S[i+3]:
            flag+=1

        if flag==0:
            print('Yes')
        else :
            print('No')
else :
    print('No')

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

flag=0

if N%2==0:
    for i in range(int(N/2)):
        if S[i]!=S[i+int(N/2)]:
            flag+=1

    if flag==0:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Verdicts: Runtime Error

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

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


n=input()
s=input()
if len(s) % 2 == 0 and 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):
# -*- coding utf-8 -*-

MOD = 10 ** 9 + 7

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

if n % 2 ==0:
    ans = 'Yes' if s[:n//2] == s[n//2:] else 'No'
else:
    ans = 'No'

print(ans)



# -*- coding utf-8 -*-

MOD = 10 ** 9 + 7

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

if n % 2 ==0:
    ans = 'Yes' if s[:n//2] == s[n//2:] else 'No'
else:
    ans = 'No'

print(ans)



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

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

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

N = int(input())
S = input()
if N%2 == 1:
  print("NO")
else:
  if(S[0: int(N//2)] == S[int(N//2): int(N)]):
    print("YES")
  else:
    print("NO")

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

Verdicts: Runtime Error

Wrong Answer

Wrong Answer

Wrong Answer

Runtime Error

Wrong Answer

Runtime Error

Wrong Answer

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

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

N, S = map(int, input().split())
n = len(S)
if n % 2 == 0:
    if S[:n // 2] == S[n // 2:]:
        print("Yes")
    else:
        print("No")
else:
    print("No")

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

Verdicts: Runtime Error

Runtime Error

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

Submission attempts (in order):
digits = int(input())
str = input()

num = int(digits/2)

str_forward = str[num:]
str_backward = str[:num]


if str_forward == str_backward:
 print("Yes")
else:
 print("No")
~               

digits = int(input())
str = input()

num = int(digits/2)

str_forward = str[num:]
str_backward = str[:num]


if str_forward == str_backward:
 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 S[:N] == S[N:]:
    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):
#a,b,c = map(int,input().split())
a = int(input())
b = input()
c = b[:a//2]
d = b[a//2:a]
print("No" if c == d else "Yes")



#a,b,c = map(int,input().split())
a = int(input())
b = input()
c = s[:a//2]
d = s[a//2:a]
print("No" if c = d else "Yes")


n = ont(input())
for i in range(2,n):
    if n % i == o:
        print("No")
        exit()
else:
    print("Yes")

#a,b,c = map(int,input().split())
a = int(input())
b = input()
c = s[:a//2]
d = s[a//2:a]
print("No" if c == d else "Yes")



#a,b,c = map(int,input().split())
a = int(input())
b = input()
c = b[:a//2]
d = b[a//2:a]
print("Yes" if c == d else "No")

Verdicts: Wrong Answer

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()) # length of string
str = input()
mid = n / 2 # the first char in later str
counter = 0
for i in range(mid):
  if n % 2 != 0:
    print("No")
    break
  elif str[i] == str[mid + i]:
    counter += 1
    
if counter == mid :
  print("Yes")

n = int(input()) # length of string
str = input()
mid = n // 2 # the first char in later str
counter = 0
if n % 2 != 0:
  print("No")
else:
  for i in range(mid):
    if str[i] == str[mid + i]:
      counter += 1   
  if counter == mid :
    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()
flag = 1

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

n = int(input())
s = input()
flag = 1

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

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

if(n % 2 != 0):
  print('NO')
elif(n != len(list(s))):  
  print('NO')
else:  
  s_list = list(s)
  num = n/2
  s1 = s_list[:int(num)]
  s2 = s_list[int(num):]

  if(len(s1) != len(s2)):
    print('NO')    
  else:  
    flag = True  
    for index in range(len(s1)):
      if(s1[index] != s2[index]):
        flag = False

    if(flag):
      print('YES')
    else:
      print('NO') 

input = [input() for i in range(2)]
n = int(input[0])
s = input[1]

if(n % 2 != 0):
  print('No')
elif(n != len(list(s))):  
  print('No')
else:  
  s_list = list(s)
  num = n/2
  s1 = s_list[:int(num)]
  s2 = s_list[int(num):]

  if(len(s1) != len(s2)):
    print('No')    
  else:  
    flag = True  
    for index in range(len(s1)):
      if(s1[index] != s2[index]):
        flag = False

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

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

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

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

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


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


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):
N = int(input())
S = input() 
print('Yes' if N%2==0 and S[:a]==S[a:] else 'No')

N = int(input())
S = input() 
a=int(N/2)
print('Yes' if N%2==0 and S[:a]==S[a:] 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):
s = list(input())
l = len(s)
if l%2==0:
  a = s[:len(s)//2]
  b = s[len(s)//2:]
  for i in range(len(s)//2):
    if a[i]==b[i]:
      pass
    else:
      print("No")
      break
  else:
    print("Yes")
else:
  print("No")



n = int(input())
s = list(input())
if n%2==0:
  a = s[:n//2]
  b = s[n//2:]
  for i in range(n//2):
    if a[i]==b[i]:
      pass
    else:
      print("No")
      break
  else:
    print("Yes")
else:
  print("No")

  

Verdicts: Wrong Answer

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

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

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

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

Verdicts: Runtime Error

Runtime Error

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

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

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

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

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

Verdicts: Wrong Answer

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

Submission attempts (in order):


import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

N = int(readline())
S = readline().decode('utf8').rsplit()

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




import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

N = int(readline())
S = read().decode('utf8').rstrip()

# print(type(S))
# print(N//2)
# print(S)
# print(''.join(S[:N // 2]+S[:N//2]) )

flag = False
if N % 2 == 0:
    M = N // 2
    flag = S[:M] == S[M:]

ans = 'Yes' if flag else 'No'
print(ans)


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())
m = input()
if m[:n//2] == m[n//2:]:
	print("yes")
else:
	print("No")

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


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

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

n = int(input())
s = input()
if n % 2 == 1:
    print('No')
    exit()
else:
    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):
N = input()
S = input()

n = int(N/2)
s1 = S[:n]
s2 = S[n:]

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

S = input()
N = input()
N = int(N/2)
S1 = S[:N]
S2 = S[N:]

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

S = input()
N = int(input())
N = int(N/2)
S1 = S[:N]
S2 = S[N:]

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

S = input()
N = int(input())
N = int(N/2)
S1 = S[:N]
S2 = S[N:]

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

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

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


N = int(input())
S = input()
if N % 2 == 1:
    print(False)
    sys.exit()
pos = int(N/2)
print(S[:pos] == S[pos:])

import sys

N = int(input())
S = input()
ret = 'No'
if N % 2 == 1:
    print(ret)
    sys.exit()
pos = int(N/2)
if S[:pos] == S[pos:]:
    ret = 'Yes'
print(ret)

Verdicts: Wrong Answer

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

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

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

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


if __name__ == '__main__':
    main()


def main():
    n = int(input())
    s = input()

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

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


if __name__ == '__main__':
    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):
a=int(input())
b=list(input())
count=0
if a%2==1:
    print("No")
else:
    for i in range(0,a//2,1):
        print(b[i])
        print(b[i+a//2])
        if b[i]!=b[i+a//2]:
            count+=1
    if count==0:
        print("Yes")
    else:
        print("No")

a=int(input())
b=list(input())
count=0
if a%2==1:
    print("No")
else:
    for i in range(0,a//2,1):
        if b[i]!=b[i+a//2]:
            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=str(input())
if n%2==1:
    print('No')
else:
    number=int(n/2)
    print(number)
    sf=[]
    sb=[]
    for i in range(0,number):
        sf.append(s[i])
    for j in range(number,n):
        sb.append(s[j])
    if sf==sb:
        print('Yes')
    else:
        print('No')

n=int(input())
s=str(input())
if n%2==1:
    print('No')
else:
    number=int(n/2)
    sf=[]
    sb=[]
    for i in range(0,number):
        sf.append(s[i])
    for j in range(number,n):
        sb.append(s[j])
    if sf==sb:
        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):
def seigi(s):
  lens = len(s)
  if lens%2==1:
    return "No"
  lensp2 = int(lens/2)
  for si in range(lensp2):
    if s[si] != s[si + lensp2]:
      return "No"
  return "Yes"
  
s = input()
print(seigi(s))

def seigi(s):
  lens = len(s)
  if lens%2==1:
    return "No"
  lensp2 = int(lens/2)
  for si in range(lensp2):
    if s[si] != s[si + lensp2]:
      return "No"
  return "Yes"
  
r = input()
s = input()
print(seigi(s))

Verdicts: Wrong Answer

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

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

N=int(input())
S=input()
ans="No"
if N%2==0:
  first=S[:int(N/2)]
  last=S[int(N/2):]
  if first==last:
    ans="Yes"
print(ans)

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
readline = sys.stdin.readline
N = int(readline())
S = readline()

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

import sys
input = sys.stdin.readline
N = int(input())
S = input().split()
 
if N%2==0:
  s1 = S[:(N//2)]
  if S == s1 + s1:
    print('Yes')
  else:
    print('No')
else:
  print('No')

import sys
readline = sys.stdin.readline
N = int(readline())
S = readline()

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

import sys
input = sys.stdin.readline
N = int(input())
S = input().rstrip()
 
if N%2==0:
  s1 = S[:(N//2)]
  if S == s1 + s1:
    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()

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


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

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

s = input()
if s[:3] == s[3:]:
  print("Yes")
else:
  print("No")

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

n //= 2
if s[:n] == s[n:]:
  print("Yes")
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 N % 2 != 0 or S[:len(S) // 2] != S[len(S) // 2:]:
    print('NO')
else:
    print('YES')

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

if N % 2 != 0 or S[:len(S) // 2] != S[len(S) // 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):
S = input()
if len(S)%2 == 1:
    print('No')
    exit()

if str(S[0:int(len(S)/2)]) == str(S[int(len(S)/2):len(S)]):
    print('Yes')
else:
    print('No')


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

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


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

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

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


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

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

if n % 2 != 0:
    print("No")
else:
    s_1 = s[:int(n/2)]
    s_2 = s[int(n/2):]
    if (s_1 == s_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:
	print("NO")

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

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):
n = int(input())
s = input()

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

mid = n // 2

t1 = s[0:mid]
t2 = s[mid:]

print(t1)
print(t2)

print('Yes') if t1 == t2 else print('No')


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

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

mid = n // 2

t1 = s[0:mid]
t2 = s[mid:]

print('Yes') if t1 == t2 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):
aaaaaaaaaaaaaaaaaaaa

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

#include<string>

using namespace std;

string S;
int N;

void input(){
  cin >> N;
  cin >> S;
}

void solve(){
  input();
  string tmp = "No";
  int K = N/2;
  if(N%2==0 && S.substr(0,K)==S.substr(K,K)) tmp="Yes";
  cout << tmp <<endl;
  return;
}

int main(){
  solve();
  return 0;
}

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

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

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



Verdicts: Runtime Error

Accepted