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 in Java7 (OpenJDK 1.7.0) (judge verdict: Wrong Answer)

import java.util.Scanner;
public class Main
{
	public static void main(String[] args)
	{
		Scanner sc = new Scanner(System.in);
		String word = sc.nextLine();
		boolean concatenation = false;

		for(int i = word.length()/2; i<word.length(); i++)
		{
			if(concatenation)
				break;
			if(word.charAt(i) == word.charAt(0))
			{
				int counter = 0;
				for(int j = i; j<word.length(); j++)
				{
					if(word.charAt(j) == (word.charAt(counter)))
					{
						counter++;
					}
					else
						break;

					if(j == word.length()-1)
					{
						concatenation = true;
						break;
					}
				}
			}
		}
		if(concatenation)
			System.out.println("Yes");
		else
			System.out.println("No");
	}
}