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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = input()
S = input()
T = S[0:3]
Q=T+T
if S in Q:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
N = input()
S = input()
T = S[0:3]
Q=T+T
if str(S)==str(Q):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

S_pre = S[:int(N/2)]
S_aft = S[int(N/2):]

flg=0
for i in range(len(S_pre)):
    if S_pre[i] != S_aft[i]:
        flg+=1

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

Submission status: Wrong Answer

Solution code:
S = input()

if len(S) %2:
  print("No")


else:
  N=len(S)
  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==1:
    print("No")
else:
    a=int(n/2-1)
    b=int(n/2)
    c=n-1
    d=s[0:a]
    e=s[b:c]
    if d==e:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:

def main():
    N = int(input())
    S = input()
    f = S[:int(N/2)]
    b = S[int(-(-N//2)):]
    if f==b and len(f)>0:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3

def main():
    N, S = map(str, open(0).read().split())
    N = int(N)
    if N < 2:
        print('No')
    else:
        if (S[0:N//2] == S[-(-N//2):]):
            print('Yes')
        else:
            print('No')


main()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3

def main():
    N, S = map(str, open(0).read().split())
    N = int(N)
    if N == 1:
        print('No')
    elif (S[0:N//2] == S[-(-N//2):]):
        print('Yes')
    else:
        print('No')


main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()
if N // 2 != 0:
    print('No')
else:
    letter = S[1:1+N//2]
    if S == letter + letter:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

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

if n % 2 == 0:
    n //= 2
else:
    n = n // 2
s2 = s[n:]
for i in range(n):
    if s[i] != s2[i]:
        print("No")
        exit()
print("Yes")

Submission status: Wrong Answer

Solution code:
import math
N = int(input())
S = input()
if N == 1:
    print("No")
    exit()

S_fommer = S[:math.floor(N/2)]
S_latter = S[math.ceil(N/2):]

if S_fommer == S_latter:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
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) 
    H1 = ss[1:sl]
    H2 = ss[sl+1:]
    if  H1 == H2 :
        A = 'Yes'
    else:
        A = 'No'
print(A)

Submission status: Wrong Answer

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

t = s[:n//2 - 1]
if n % 2 == 0:
    # flg = t in s[n//2:]
    if t == s[n//2:]:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

t = s[:n//2 - 1]
flg = t in s[n//2:]
if flg:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def resolve():
    n=int(input())
    s=input()
    if n%2!=0 or n==0:
        print('No')
    else:
        s1 = s[0:n // 2 - 1]
        s2 = s[n//2:n-1]
        if s1==s2:
            print('Yes')
        else:
            print('No')
resolve()

Submission status: Wrong Answer

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

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)+1:]:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

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

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

Submission status: Wrong Answer

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

if N == 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')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s = list(input())
l = [s[i] for i in range(n // 2)]
u = [s[i] for i in range(n // 2, n)]
flag = True
for i in range(len(l)):
    if l[i] == u[i]:
        pass
    else:
        flag = False
if flag:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print('Yes')

Submission status: Wrong Answer

Solution code:
N=int(input())
S=str(input())
if N%2!=0:
  print('No')
elif S[0:round(N/2)-1]==S[round(N/2):N-1]:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
N = int(input())
S = list(input())
i = N/2

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

Submission status: Wrong Answer

Solution code:
N = int(input())
S = str(input())
i = N/2

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

Submission status: Wrong Answer

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

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

i = N/2

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

Submission status: Wrong Answer

Solution code:
N = int(input())
S = str(input())
if N % 2 != 0:
    print("No")
    exit()
i = N/2-1
if S[:int(i)] == S[int(i+1):int(N-1)]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

i = N/2-1

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

Submission status: Wrong Answer

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

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

i = N/2-1

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if n%2 == 0:
    p = n//2
    print(S[:p],S[p:])
    if S[:p] == S[p:]:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
n=int(input())
s=input()
ans="Yes"
if n==1:
    ans="No"
for i in range(math.ceil(n/2-2)):
    if(s[i]!=s[i+math.ceil(i/2)]):
        ans="No"
        break
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n  = int(input())
s = input()
num = n // 2

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

elif n == 1:
    print("No")

else:
    if s[:num] == s[(num+1):]:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
n  = int(input())
s = input()
num = n // 2

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

else:
    if s[:num] == s[(num+1):]:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

is_even = N % 2 == 0
S1 = S[0:int(len(S) / 2)]
S2 = S[int(len(S) / 2):]

answer = True if is_even and S1 == S2 else False

print(answer)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input() 
if s.count(s[0:n//2]) == 2 and n != 1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input() 
if s.count(s[:n//2]) == 2 and n != 1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
n=int(input())
s=input()
s1=s[:n//2]
s2=s[n-(n//2):]
if s1==s2:
    print('Yes')
else :
    print('No')

Submission status: Wrong Answer

Solution code:
import math
n=int(input())
s=input()
s1=s[:n//2]
s2=s[math.ceil(n/2):]
if s1==s2:
    print('Yes')
else :
    print('No')

Submission status: Wrong Answer

Solution code:
S = input().strip()
q, r = divmod(len(S), 2)
if r == 0 and S[:q] == S[q:]:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=int(input())
S=input();print('YNeos'[S[:a]==S[a:]::2])

Submission status: Wrong Answer

Solution code:
a=int(input())
b=input()
if b[:a]==b[a:]:print('Yes')
else: print('No')

Submission status: Wrong Answer

Solution code:
n = int(input())
 
s = input()
 
sss = len(s) // 2
 
if sss == 1:
    print("No")
else:
    a = s[:int(len(s)/2)]
    if a*2 == s:
        print("Yes")
    else:
        print("NO")

Submission status: Wrong Answer

Solution code:
n = int(input())

s = input()

sss = len(s) // 2

if sss == 1:
    print("No")
else:
    a = s[:int(len(s)/2)]
    if a*2 == s:
        print("Yes")
    else:
        print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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[i + N //2]:
      print('No')
      exit(0)
    else:
      print('Yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()
if N % 2 == 1:
  print("No")
  exit()

C = N // 2
D = N + 1
if S[0:C] == S[C:N]:
    print("Yes")

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()
if N % 2 == 1:
  print("No")
  exit()

C = N // 2
D = N + 1
if S[0:C] == S[C:D]:
    print("Yes")

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()
v = len(s)//2

count = 0

for i in range(v):
    if s[i] == s[len(s) - i - 1]:
        count += 1
if count >= v:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

a = int(n/2)
if n==2:
    a = 0
count=0
for i in range(0,a):
    if s[i] == s[i+int(n/2)]:
        count+=1

if count==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')
    exit()

a = int(n/2)
if n==2:
    a = 0
count=0
for i in range(0,a):
    if s[i] == s[i+int(n/2)]:
        count+=1

if count==a:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
n = input()
s = raw_input()
print s[:n/2] == s[n/2:]

Submission status: Wrong Answer

Solution code:
N=int(input())
S=input()
A=S[:N//2]
B=S[N//2:]
ans=0
if N%2!=0:
    ans=-1
for i in range(N//2):
    if A[i]!=B[i]:
        ans=-1
        break
    else:
        pass
print(ans)
if ans==-1:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
N = int(input())
T = input()
l = []
m = []
for i in range(int(len(T) / 2) - 1):
    l.append(T[i])
for j in range(int(len(T) / 2) ,len(T) - 1):
    m.append(T[j])
if l == m:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
N = int(input())
T = input()
l = []
m = []
for i in range(int(len(T) / 2)):
    l.append(i)
for j in range(int(len(T) / 2) + 1 ,len(T) ):
    m.append(j)
if l == m:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
numberOfWord = int(input())
word = input()
center = int(numberOfWord / 2)

firstWord = word[0:center]
secondWord = word[center:]

if (firstWord == secondWord):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
numberOfWord = int(input())
word = input()
center = int(numberOfWord / 2)

firstWord = word[0:center]
secondWord = word[center:]

if (firstWord == secondWord):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
def main():
    n = int(input())
    s = list(input())
    if n % 2 != 0:
        print("No")
    else:
        if n == 2:
            if s[0] == s[1]:
                print("Yes")
        else:
            div = n // 2
            if s[:div-1] == s[div:n-1]:
                print("Yes")
            else:
                print("No")


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
def main():
    n = int(input())
    s = list(input())
    if n % 2 != 0:
        print("No")
    else:
        div = n // 2
        if s[:div-1] == s[div:n-1]:
            print("Yes")
        else:
            print("No")


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def solve():
    N = int(input())
    S = input()
    if N % 2 == 0:
        if S[:(N//2)] == S[(N//2):]:
            print(S[:(N//2+1)])
            print(S[(N//2):])
            print('Yes')
        else:
            print('No')
    else:
        print('No')

if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

Solution code:
n = int(input())
s = str(input())
a = len(s) %2
b = len(s) //2
ans =0
if a !=0:
  print('NO')
else:
  for i in range(b):
    if  s[i] != s[i+b]:
      ans +=1
  print('Yes' if ans ==0 else 'No')

Submission status: Wrong Answer

Solution code:
#B
n=int(input())
s=list(input())
f=False
for i in range(n//2):
    if s[i]!=s[n//2+i]:
        f=True
if f:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
_,s=open(0);print('YNeos'[s[:len(s)//2]*2!=s::2])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N= int(input())
flag = False
for i in range(1,10):
	for j in range(1,10):
		A=i*j
		if(A==N):
			flag=True
			break
	if flag: break
if flag:print("Yes")
else:print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()
ans = "No"
if N%2 == 0:
  if S[:N//2-1] * 2 == S:
    ans = "Yes"
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read 
input = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines  

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

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read 
input = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines  

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

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read 
input = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines  

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

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

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read 
input = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines  

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

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

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read 
input = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines  

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

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

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()
ans = False
if N % 2 == 0:
  ans = S[:N//2] == S[N//2:]
print(ans)

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

S1 = S[0:N]
if S == S[0:N]+S[0:N]:
    print ('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

S1 = S[0:N]
if S == S1+S1:
    print ('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
n = int(input())

s = str(input())

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

Submission status: Wrong Answer

Solution code:
N = int(input())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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