Palindrome Check

1.0s 256M

A string is called a palindrome if it reads the same forwards and backwards.

Given a string of length \(n\), determine whether it is a palindrome.

Syntax Restrictions

This is a C++ character-array practice problem. Your source code is checked automatically during judging.

Only #include <iostream> is allowed. Although the input is a string, store it with a C-style character array, such as char s[500005].

You may not use string, basic_string, vector, or other STL containers. You also may not use other headers such as <string>, <vector>, or <bits/stdc++.h>.

A submission that breaks the restrictions is judged SR (Syntax Restriction), and the judge feedback lists where the violation is.

Input

The input consists of 2 lines.

The first line contains a positive integer \(n\) (\(1 \le n \le 5 \times 10^5\)).

The second line contains a string of length \(n\) consisting of lowercase letters.

Output

Output “Yes” if the input string is a palindrome; otherwise, output “No”.

Sample Input 1

4
abba

Sample Output 1

Yes

Sample Input 2

5
abcab

Sample Output 2

No

Problem page help

Keyboard shortcuts

Main features

  • Sample tests — Runs the sample cases bundled with the problem and auto-compares against the expected output.
  • Custom test — Run your code with your own stdin. Optionally tick the "Compare with expected (diff)" box to verify against expected output line-by-line.
  • Template — Paste the default code template you set on your profile page.
  • Collab — Edit this problem together with classmates in real time.
  • Auto-draft — Editor contents auto-save to your browser every 1.5 seconds (per account / problem / language).
  • Submit — Send your code to the judge for grading; returns AC / WA / TLE etc.

Limits

  • Source code: at most 65,536 characters
  • Custom test stdin and expected output: at most 1 MB each (≈1 million characters)
  • Custom test: about 1 request per 3 s per user (sample test: 1 per 1 s)
  • Custom test has a 15 second wall-clock cap; sample tests use the problem time limit, the same as the official judge
  • Interactive problems do not offer custom test (cannot simulate interaction with the judge).
  • Submitting has no rate limit, but rapid repeated submissions on the same problem are treated as score farming.