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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.Scanner;

class Main {
	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
		int number = input.nextInt();
		String word = input.next();
		String firstHalf = "";
		String secondHalf = "";
		if (word.length()%2 == 0 & number == word.length()) {
			for(int i = 0; i<(number/2); i++) {
				firstHalf = firstHalf + word.charAt(i);
				secondHalf = secondHalf + word.charAt(i+(number/2));
				System.out.println(firstHalf); 
				System.out.println(secondHalf); 
			}
			if (firstHalf.equals(secondHalf)) {
				System.out.println("Yes"); 
			}else {
				System.out.println("No"); 
			}
		}else {
			System.out.println("No");   
		}
    	
    }
}