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

Solution (Python):


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

Solution (Python):
N = int(input())
S = input()
T = S[0:N//2]
if S == T+T:
  print('Yes')
else:
  print('No')

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

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

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

  print('Yes' if left == right else 'No')

Solution (Python):
N = int(input())
S = input()
M = N//2


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

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

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

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

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

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

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

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

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

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

ans=True

if n%2==1:
	ans=False
else:
	if s[0:n//2]!=s[n//2:]:
		ans = False

if ans is True:
	print("Yes")
else:
	print("No")

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

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

Solution (Python):


N = int(input())

if(N % 2 != 0):
    print("No")
else:
    S = input()

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

Solution (Python):
def main():
    n = int(input())
    s = list(input())

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


if __name__ == '__main__':
    main()

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

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

Solution (Python):
import sys
import math
stdin = sys.stdin
mod = 10**9 + 7

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
sa = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]

n = ni()
s = ns()

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

Solution (Python):

import sys
import math
import numpy as np
import itertools

n = int(input())

s = list(input())

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

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

print("Yes")

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

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

print('Yes')

Solution (Python):
N=int(input())
S=list(input())
c=[]
for i in range(int(N/2)):
  c.append(S[i])
if S==c+c:
  print("Yes")
else:
  print("No")

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

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

for i in range(n//2):
    if s[i] == s[n//2+i]:
        continue
    else:
        print('No')
        exit()
        
print('Yes')

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

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

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

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

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

Solution (Python):
N = int(input())
S = list(input())
if N%2 == 0:
    judge = 'Yes'
    for n in range(N//2):
        if S[n] != S[n+N//2]:
            judge = 'No'
            break
else:
    judge = 'No'
print(judge)

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

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

n = INT()
s = input()
m = n//2



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

Solution (Python):

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

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

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

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

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

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

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

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

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

Solution (Python):
n = int(input())
s = input()
if n%2 != 0:
  print("No")
else:
  yes = True
  for i in range(0, n//2):
    if s[i] == s[i+n//2]:
      pass
    else:
      yes = False
  if yes:
    print("Yes")
  else:
    print("No")

Solution (Python):
n = int(input())
s = input().strip()
print('Yes' if n & 1 == 0 and s[:n // 2] == s[n // 2:] else 'No')

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

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

Solution (Python):
n = int(input())
s = input()
l = len(s)
if l%2!=0:
    print("No")
else:
    if s[:l//2]==s[l//2:]:
        print("Yes")
    else:
        print("No")

Solution (Python):

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

Solution (Python):
import sys

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

Solution (Python):
N = int(input())
S = input()
ok = True
if N % 2 != 0:
    ok = False
if S[: N // 2] != S[N // 2:]:
    ok = False
print("Yes") if ok else print("No")

Solution (Python):
import math

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

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

Solution (Python):
n = int(input())
s = input()
num = n // 2
ans = 'No'
if s[:num] == s[num:]:
    ans = 'Yes'
print(ans)

Solution (Python):
n = int(input())
s = input()
if n % 2 == 1:
    print("No")
else:
    m = n // 2
    flag = False
    for i in range(m):
        if s[i] != s[i + m]:
            flag = True
            break
    if flag:
        print("No")
    else:
        print("Yes")

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

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

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

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

Solution (Python):
n = int(input())
S = input()
half = n//2
if(S[:half]==S[half:]):
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())

s = input()

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

print("No")

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

k=1
if n%2==1:
  k=-1
else:
  for i in range(n//2):
    if s[i] != s[i+n//2]:
      k=-1

if k==1:
  print("Yes")
if k==-1:
  print("No")

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

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

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

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

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

print('Yes')

Solution (Python):
N = int(input())
S = input()
if N % 2 == 1:
  print('No')
else:
  part1 = S[:int(N/2)]
  part2 = S[int(N/2):]
  if part1 == part2:
    print('Yes')
  else:
    print('No')

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

Solution (Python):
n = int(input())
s = input()
if n%2==1:
  print("No")
else:
  b = True
  for i in range(n//2):
    if not s[i] == s[i+n//2]:
      b = False
      break
  if b:
    print("Yes")
  else:
    print("No")

Solution (Python):
n=int(input())
a=list(input())
if n%2!=0:
  print('No')
else:
  b=a[0:(n//2)]
  c=a[(n//2):n]
  if b==c:
    print('Yes')
  else:
    print('No')

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

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

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

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

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

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

Solution (Python):


import sys
import math
import collections
import itertools
from inspect import currentframe
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def MI() : return map(int, input().split())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]
def chkprint(*args) : names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}; print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))

N = I()
S = input()

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

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

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

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

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

Solution (Python):
import itertools

def main():
    N = int(input())
    S = input()

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

if __name__ == "__main__":
    main()

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

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

Solution (Python):

N = int(input())

S = input()

i = int(len(S)/2)

x = S[0:i]
y=  S[i:len(S)]

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

if x == y:
    print('Yes')
else:
    print('No')

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

if n % 2 == 1:
    print('No')
else:
    ok = True
    for i in range(n // 2):
        if s[i] != s[n // 2 + i]:
            ok = False
            break
    if ok:
        print('Yes')
    else:
        print('No')

Solution (Python):
n=int(input())
s=input()
t=int(n/2)

if n%2!=0:
    print("No")
    exit()
elif s[0:t] == s[t:n]:
    print('Yes')
    exit()
else:
    print('No')

Solution (Python):
N=int(input())
S=list(str(input()))
if N%2==1:
  print('No')
else:
  s1=S[0:N//2]
  s2=S[N//2:N]
  if s1==s2:
    print('Yes')
  else:
    print('No')

Solution (Python):

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

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    
        
        
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    R = lambda: list(map(int, r().split()))
    Rmap = lambda: map(int, r().split())
    Rfloat = lambda: list(map(float, r().split()))
    Rtuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    

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

    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Solution (Python):
import sys
N=int(input())
S=input()
if N%2==1:
  print('No')
  sys.exit()

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

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

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

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

Solution (Python):

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

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

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

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

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

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

Solution (Python):


from collections import deque, defaultdict
import itertools as ite
import sys
import math
import decimal

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

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

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

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

Solution (Python):
words = lambda t : list(map(t, input().split()))
n = int(input())
s = input()

if n % 2 != 0:
    print("No")
else:
    ans = True
    for i in range(n//2):
        
        if s[i] != s[n//2 + i]:
            ans = False
            break
    if ans:
        print("Yes")
    else:
        print("No")

Solution (Python):



def ri():
    return int(input())

def rl():
    return list(input().split())

def rli():
    return list(map(int, input().split()))

def main():
    n = ri()
    s = input()
    if n % 2 == 1 or s[:n//2] != s[n//2:]:
        print("No")
        return
    print("Yes")


if __name__ == '__main__':
    main()

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

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

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

N = int(input())
S = input().strip()

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

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

S_1 = S[: int(N / 2)]
S_2 = S[int(N / 2) :]

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

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

Solution (Python):



import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

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

Solution (Python):

import sys
def input():
    return sys.stdin.readline().rstrip()

def main():
    N=int(input())
    S=input()

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


if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
S = input()
print(['No', 'Yes'][int(S[:N//2] == S[N//2:])])

Solution (Python):

import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1

def read_int():
    return int(input())


def read_int_n():
    return list(map(int, input().split()))


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(N, S):
    if N % 2 != 0:
        return 'No'
    if S[:N//2] == S[N//2:]:
        return 'Yes'
    return 'No'


def main():
    N = read_int()
    S = read_str()
    print(slv(N, S))


if __name__ == '__main__':
    main()

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

r = N % 2

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

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

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

Solution (Python):
n=int(input())
s=list(input())
flag=False
if n%2==0:
  v=int(n/2)
  l=s[0:v];r=s[v:n]
  if l==r:
    flag=True
if flag:
  print("Yes")
else:
  print("No")