Problem:


Score : 200 points

Problem Statement

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.

Constraints

1 \leq N \leq 100

S consists of lowercase English letters.

|S| = N

Input

Input is given from Standard Input in the following format:

N
S

Output

If S is a concatenation of two copies of some string, print Yes; otherwise, print No.

Sample Input 1

6
abcabc

Sample Output 1

Yes

Let T =  abc, and S = T + T.

Sample Input 2

6
abcadc

Sample Output 2

No

Sample Input 3

1
z

Sample Output 3

No



Sample input:
6
abcabc


Sample output:
Yes

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

N = int(raw_input())
S = raw_input()

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

Submission status: Wrong Answer

Solution code:
N = int(raw_input())
S = raw_input()

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

Submission status: Wrong Answer

Solution code:
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')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
t = [i for i in input()]

if n % 2 == 1:
    print('NO')
else:
    if t[:int(n/2)] == t[int(n/2):]:
        print('YES')
    else:
        print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys


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

    half = int(n / 2)

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

    print("No")


main()

Submission status: Wrong Answer

Solution code:
def main():
    N = int(input())
    S = input()
    if N % 2 != 0:
        print("No")
    
    center_index = int(N/2)
    pre_S = S[:center_index]
    tail_S = S[center_index:]
    if pre_S == tail_S:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
N = int(input())
S = str(input())

half = int(N/2)

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

Submission status: Wrong Answer

Solution code:
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')

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
N = input()
N = int(N)
S = input()
S = S.split()
S = list(S)

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
n=int(input())
s=input()
if n%2==1:
  print("NO")

n=n//2
if s[:n]==s[n:]:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
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()))

Submission status: Wrong Answer

Solution code:
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")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()

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

Submission status: Wrong Answer

Solution code:
N = int(input())
S = str(input())

if N%2 == 0:
  N_2 = int(0.5*N)
  if S[:N_2]==S[N_2:]:
    print("YES")
  else:
    print("NO")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
import sys


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

Submission status: Wrong Answer

Solution code:
N=int(input())
s=input()

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

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()

if N == len(S):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()

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

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s = str(input())
if int(n) <= 100 and int(n) >=1 and int(n) == len(s) and s.islower(): 
    s1 = s[int(len(s)/2):]
    print(s1)
    if s.count(s1)==2:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
n = int(input())
s = str(input())
if int(n) <= 100 and int(n) >=1 and int(n) == len(s):
    if s.islower():
        half = len(s)/2
        s1 = s[int(half):]
        print(s1)
        if s.count(s1)==2:
            print("Yes")
        else:
            print("No")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
n = int(input())
s = [str(x) for x in input()]
print(s)
if n % 2 == 1:
    print('No')
else:
    a = int(n/2)
    if s[0:a] == s[a:]:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
#coding by utf-8
N = int(input())
S = str(input())
t = int(N / 2)
if S[:t] == S[t:]:
  print("Yes")
else:
  print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
_ = input()
s = input()
mid = int((len(s)+1)/2)
if s[:mid] == s[mid:]:
    print("Yes")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()

a = s[0:int(n/2)]
b = s[int(n/2):]

print(a,b)

if n % 2 != 0 or n != len(s):
    print("No")
elif a == b:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()

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

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()
res = 'YES' if s[:n//2] == s[n//2:] and n % 2 == 0 else 'NO'
print(res)

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()

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

Submission status: Wrong Answer

Solution code:
N=int(input())
S=input()
n=int(N/2)
if N%2==1:
    print("No")
else:
    s_1=S[0:n-1]
    s_2=S[n:N-1]
    if s_1==s_2:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
N=int(input())
S=input()
n=int(N/2)
if N==1:
    print("NO")
else:
    s_1=S[0:n-1]
    s_2=S[n:N-1]
    if s_1==s_2:
        print("Yes")
    else:
        print("NO")

Submission status: Wrong Answer

Solution code:
n = int(raw_input())
s = str(raw_input())

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

h = len(s) / 2

if s[0:h] == s[h:len(s)]:
    print 'Yes'

Submission status: Wrong Answer

Solution code:
n = int(raw_input())
s = str(raw_input())

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

h = len(s) / 2

if s[0:h] == s[0:-h]:
    print 'Yes'

Submission status: Wrong Answer

Solution code:
n = int(input())

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

else:
    print('No')

Submission status: Wrong Answer

Solution code:
import sys
INPUT = sys.stdin.readline
#入力関数
def SORO_INT(): return int(INPUT())
def MULT_INT_LIST(): return list(map(int, INPUT().split()))
def MULT_INT_MAP(): return map(int, INPUT().split())
def SORO_STRING(): return INPUT()
def MULT_STRING(): return INPUT().split()

N = SORO_INT()
S = SORO_STRING()

if N%2==0:
    N = int(N)
else:
    print('No')
    sys.exit()
S_1 = S[:N//2]

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

Submission status: Wrong Answer

Solution code:
import sys
INPUT = sys.stdin.readline
#入力関数
def SORO_INT(): return int(INPUT())
def MULT_INT_LIST(): return list(map(int, INPUT().split()))
def MULT_INT_MAP(): return map(int, INPUT().split())
def SORO_STRING(): return INPUT()
def MULT_STRING(): return INPUT().split()

N = SORO_INT()
S_moto = SORO_STRING()
print(S_moto)

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

S_1 = S_moto[0:N//2]
S_2 = S_1+S_1

if S_moto == S_2:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()

N2 = int(N/2)
ans = "Yes"
for i in range(N2):
  if S[i] != S[i + N2]:
    ans = "No"

print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input().strip())
if N%2!=0:
  print("No")

S=input().strip()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
S = str(input())
setty = set(S)
if len(setty) * 2 == N:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
N = int(input())
S = str(input())
setty = set(S)
n = N / 2
if len(setty) % n == 0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
N = int(input())
S = str(input())

result = "yes"
n= int(N/2)
if(N%2 == 0):
    for i in range(n):
        if(S[i] != S[n+i]):
            result = "no"
else:
    result = "no"
print(result)

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()
if n % 2 == 0:
    n = n // 2
    for i in range(n):
        if s[i] != s[n + i]:
            print('No')
            break
    else:
        print('Yes')
else:
    print('no')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()
st = []
if N % 2 == 0:
    num = int(N/2)
    st = S[0:num:None]
    if st.replace(st,"").replace(st,"") == "":
        print("Yes")
        exit()
print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
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')

Submission status: Wrong Answer

Solution code:
n = int(input())
lst = input()
l_even = lst[: (n-1)//2]
l_eleven = lst[(n-1)//2 :]
if n%2 ==1:
  print("No")
elif l_even in l_eleven:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
n = int(input())
lst = input()
l_even = lst[: (n-1)//2]
l_eleven = lst[(n-1)//2 :]
if n ==1:
  print("No")
elif l_even in l_eleven:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
n=int(input())
s=input()

flag=True

if(n%2):
  flag=False
elif(not s[0:int(n/2)-1]==s[int(n/2):]):
  flag=False

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

Submission status: Wrong Answer

Solution code:
n = int(input ())
s = input()

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

Submission status: Wrong Answer

Solution code:
n = int(input ())
s = input()

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()
if len(s)&1:
  print("No")
else:
  if s[0:len(s)//2]==s[len(s)//2-1:]:
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
n=int(input())
s=input()

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

Submission status: Wrong Answer

Solution code:
n=int(input())
s=input()

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

Submission status: Wrong Answer

Solution code:
N=int(input("Enter"))
S=input()
count=0
if N%2!=0:
  print("No")
elif len(S)!=N:
    print("No")
else:
  for i in range(int(len(S)/2)):
    if S[i]!=S[int(len(S)/2)+i]:
      print("No")
      break
    count+=1
  if count==len(S)/2:
    print("Yes")

Submission status: Wrong Answer

Solution code:
s = input()
m = len(s)//2

print('Yes') if s[:m] == s[m:] else print('No')

Submission status: Wrong Answer

Solution code:
n=int(input())
t=input()
T=list(t)

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

Submission status: Wrong Answer

Solution code:
n=int(input())
t=input()
T=list(t)
 
if T[0:3]==T[3:6]:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
n = int(input())
s = list(input())
s1=[]
if( n %2 != 0):
    print("No")
else:
    for i in range(0,int(n/2)):
        a = s.pop(0)
        s1.append(a)
if(s ==s1):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()

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

Submission status: Wrong Answer

Solution code:
n=int(input())
s=input()

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

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()
H = list(S)
P = len(H)
oo = []
ll = []
if P%2 == 0:
  for a in range (0,int(N/2)):
    oo.append(H[int(a)])
    ll.append(H[int(a+N/2)])
  if oo == ll :
    print("Yes")
else :
  print("No")

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()
H = list(S)
P = len(H)
oo = []
ll = []
if P/2 == 0:
  for a in range (0,N/2):
    oo.append(a)
    ll.append(a+N/2)
    if oo == ll :
      print("Yes")
else :
  print("No")

Submission status: Wrong Answer

Solution code:
import sys
n=int(input())
s = list(input())
ans = 0
if n % 2 != 0:
    print("No")
    sys.exit()
for i in range(n//2 - 1):
    if s[i] != s[i+n//2+1]:
        ans = 1
if ans == 0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
n=int(input())
s = list(input())
ans = 0
if n % 2 != 0:
    print("No")
    sys.exit()
for i in range(n//2 - 1):
    if s[i] != s[i+n//2]:
        ans = 1
if ans == 0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
n=int(input())
s = list(input())
ans = 0
if n % 2 != 0:
    print("No")
for i in range(n//2 - 1):
    if s[i] != s[i+n//2]:
        ans = 1
if ans == 0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
S = str(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
s=input()

if n == 1:
  print("No")
  exit()

for i in range(n//2):
  if s[i] != s[(n//2)+i]:
    print("No")
    exit()

print("Yes")

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()

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

N = int(N / 2)
s = S[:N]

if s + s == S:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
N=int(input())
S=input()

if N%2 !=0:
    print('no')
else:
    a=N//2
    t=S[0:a]
    if t+t==S:
        print('yes')
    else:
        print('no')

Submission status: Wrong Answer

Solution code:
n=int(input())
s=list(input())

if n%2 !=0:
    print('no')
else:
    a=n//2
    t=s[0:a]
    if t+t==s:
        print('yes')
    else:
        print('no')

Submission status: Wrong Answer

Solution code:
n=int(input())
s=list(input())
t=n//2
if len(s)!=n:
    print('no')
if n%2 !=0:
    print('no')
elif s[0:t]==s[t:n]:
    print('yes')
elif s[0:t]!=s[t:n]:
    print('no')

Submission status: Wrong Answer

Solution code:
n=int(input())
s=list(input())
t=n//2
if len(s)!=n:
    print('no')
if n%2 !=0:
    print('no')
elif s[0:t]==s[t:n]:
    print('yes')
else:
    print('no')

Submission status: Wrong Answer

Solution code:
n=int(input())
s=list(input())
t=n//2
if len(s)!=n:
    print('no')
if n%2 !=0:
    print('no')
elif s[0:t]==s[t:n]:
    print('yes')

Submission status: Wrong Answer

Solution code:
n=int(input())
s=list(input())
t=n//2
if n%2 !=0:
    print('no')
elif s[0:t]==s[t:n]:
    print('yes')
else:
    print('no')

Submission status: Wrong Answer

Solution code:
N = int(input(""))
S = input("")

if N % 2 != 0:
    print("No")
else:
    center = N // 2
    for i in range(0,center):
        print(S[i],S[i+center])
        if S[i] != S[i+center]:
            print("No")
            break
        if i == center-1:
            print("Yes")

Submission status: Wrong Answer

Solution code:
N = int(input(""))
S = input("")

if N % 2 != 0:
    print("NO")
else:
    center = N // 2
    for i in range(0,center):
        if S[i] != S[i+center]:
            print("No")
            break
        if i == center-1:
            print("Yes")

Submission status: Wrong Answer

Solution code:
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")

Submission status: Wrong Answer

Solution code:
# -*- 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")

Submission status: Wrong Answer

Solution code:
a = int(input())
s = input()

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

Submission status: Wrong Answer

Solution code:
n = int(input())
st = input()
if len(st) == 1:
  print("No")
elif n % 2 == 0:
  print("No")
else:
  first = st[n//2:]
  last = st[:n//2]
  if first == last:
    print("Yes")
  else:
  	print("No")

Submission status: Wrong Answer

Solution code:
N = int(input())
S = list(input())
flg = False

if len(S) == 1:
    print("No")

elif len(S)%2 == 1:
    print("No")
else:
    num = len(S) // 2

    for i in range(num):
        if S[i] == S[i+num]:
            flg = True
        else:
            flg = False
            break

if flg == True:
    print("Yes")

else:
    print("No")

Submission status: Wrong Answer

Solution code:
n = int(input())
a = input()

b = a[0:n//2]
c = a[n//2-1:n-1]

#print(b)
#print(c)

if n!=1:
	if b==c :
		print('Yes')
	else:
		print('No')
else:
	print('No')

Submission status: Wrong Answer

Solution code:
a = int(input())
b = str(input())
c = list(b)
d = int(int(a) / 2 - 1)
e = []
f = []
g = int(int(a) / 2)
h = 0

while d >= h:
  e = c[h]
  h += 1
  
while g <= a - 1:
  f = c[g]
  g += 1
  
if e == f:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
n = int(input())
a = input()

b = a[0:n//2]
c = a[n//2-1:n-1]

if b==c :
	print('Yes')
else:
	print('No')

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()
if S[0:N//2] == S[N//2:N]:
    print("yes")
    
elif S[0:N//2] != S[N//2:N]:
    print("No")

else:
    print("No")

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()

if S[0:N//2] == S[N//2:N]:
    print("yes")
    
elif S[0:N//2] != S[N//2:N]:
    print("No")

else:
    ("No")

Submission status: Wrong Answer

Solution code:
# -*- coding:utf-8 -*-

def solve():
    N = int(input())
    S = input()
    if N%2 != 0:
        print("No")
        return

    l_str = S[0:N//2-1]
    r_str = S[N//2:]

    if l_str == r_str:
        print("Yes")
        return

    print("No")

if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
n = int(input())
lst = input()
l_even = lst[: (n-1)//2]
l_eleven = lst[(n-1)//2 :]
if l_even in l_eleven:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(raw_input())
mid = n/2
ss = raw_input()
print ss[:mid] == ss[mid:]

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = str(input())
s = str(input())
s_l = s[0:len(s)//2]
s_r = s[len(s)//2:len(s)]
if s_l == s_r:
    print('TRUE')
else:
    print('FALSE')

Submission status: Wrong Answer

Solution code:
n = int(input())
a = input()

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

Submission status: Wrong Answer

Solution code:
s = raw_input()
t  = s[len(s)/2:]
if ((t+t) == s):
    print "Yes"
else:
    print "No"

Submission status: Wrong Answer

Solution code:
s = input()
if len(s)%2 != 0:
  print('No')
else:
  if s[0:len(s)//2] == s[len(s)//2:len(s)]:
    print('Yes')
  else:
    print('No')

Submission status: Wrong Answer

Solution code:
s = input()
if len(s)%2!=0:
  print('No')
else:
  if s[0:len(s)//2]==s[len(s)//2:len(s)]:
    print('Yes')
  else:
    print('No')

Submission status: Wrong Answer

Solution code:
num=int(input())
data=list(input())
count=0

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

else:
  half=num//2
  for i in range(half):
    if data[i]==data[half+i]:
      count+=1          
  if count==half:
    print("Yes")

Submission status: Wrong Answer

Solution code:
num=int(input())
data=list(input())
half=num//2
count=0

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

else:
  for i in range(half):
    if data[i]==data[half+i]:
      count+=1          
  if count==half:
    print("Yes")

Submission status: Wrong Answer

Solution code:
s = input()
t = len(s)
if s[:t//2]==s[t//2:]:
  print('Yes')
else: print('No')

Submission status: Wrong Answer

Solution code:
s = input()
t = len(s)
if s[:t//2]==s[t//2]:
  print('Yes')
else: print('No')

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()

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

Submission status: Wrong Answer

Solution code:
import math
n = int(input())
word = list(input())
center = math.floor(n / 2)
if n > 0 and "".join(word[:center]) == "".join(word[-center:]):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math
n = int(input())
word = list(input())
center = math.floor(n / 2)
if "".join(word[:center]) == "".join(word[-center:]):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math
n = int(input())
word = list(input())
center = math.ceil(n / 2)
if "".join(word[:center]) == "".join(word[-center:]):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math
word = list(input())
center = math.ceil(len(word) / 2)
if "".join(word[:center]) == "".join(word[-center:]):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
def main():
    global visited, adj, sets
    print = out.append
    ''' Cook your dish here! '''
    q = get_int()
    st = sys.stdin.readline().strip()
    if st[:q//2]==st[q//2:]:
        print("YES")
    else:
        print("NO")



''' Coded with love at India by Satyam Kumar '''
import sys, threading
from collections import defaultdict
#input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
out = []
get_int = lambda: int(input())
get_list = lambda: list(map(int, input().split()))
main()
# [main() for _ in range(int(input()))]
print(*out, sep='\n')

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()
if(len(s) % 2 != 0):
    print('No')
    exit()
for i in range(len(s)//2-1):
    if(s[i] != s[i + len(s)//2]):
        print('No')
        exit()
print('Yes')

Submission status: Wrong Answer

Solution code:
n = int(input())
string = input()

length = len(string)

if length // 2 == 1 or string[:length//2] != string[length//2:]:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()

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

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()

if N%2 == 1:
  print('No')
elif S[1:int(N/2)] == S[int(N/2+1):N]:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(raw_input())
if n % 2 > 0:
  print False
else:
  s = raw_input()
  h = n/2
  print s[:h] == s[h:]

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s = list(input())
i = 0
Answer = "No"
if n%2 == 0:
  while i < n/2 :
    if s[i] == s[int((n/2))+i]:
      Answer = "Yes"
      i += 1
    else:
      break
print(Answer)

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()
if N % 2 == 1:
  print('No')
else:
  if S[:3] == S[3:]:
    print('Yes')
  else:
    print('No')

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
 
n=int(input())
s=input()
if n%2:
    print("No")
    exit()

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

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
 
n=int(input())
s=input()
if n%2:
    print("No")
    exit()
    
s1=s[:n//2]
s2=s[n//2:]
#if s1==s2:
if s==(s1+s1):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
 
n=int(input())
s=input()
s1=s[:n//2]
s2=s[n//2:]
#if s1==s2:
if s==(s1+s1):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
def judge(N,str):
    a = list(str)
    b = []
    c = []
    if N%2 == 0:
        for k in range(int(N/2)):
            b.append(a[k])
            c.append(a[k+int(N/2)])
        if a == b + c:
            print("yes")
        else:
            print("No")
    else:
        print("No")
N = int(input())
S = input()
judge(N,S)

Submission status: Wrong Answer

Solution code:
def judge(N,str):
    a = list(str)
    b = []
    c = []
    if N%2 == 0:
        for k in range(int(N/2)):
            b.append(a[k])
            c.append(a[k+int(N/2)])
        if b == c:
            print("yes")
        else:
            print("No")
    else:
        print("No")
N = int(input())
S = input()
judge(N,S)

Submission status: Wrong Answer

Solution code:
n,a=open(0);n=int(n);print("YNeos"[a[:n//2]!=a[n//2:]::2])