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 Rust (1.15.1) (judge verdict: Accepted)

fn main() {
	let mut N = String::new();
    let mut S = String::new();
    std::io::stdin().read_line(&mut N).ok();
    std::io::stdin().read_line(&mut S).ok();
    let N: i32 = N.trim().parse().unwrap();
    S = S.trim().to_string();
    if N % 2 == 1 {
        println!("No");
    } else {
        let s1 = &S[..(N/2) as usize];
        let s2 = &S[(N/2) as usize..];
        if s1 == s2 {
            println!("Yes");
        } else {
            println!("No");
        }
    }
}