Check whether a string is a palindrome

Problem

Given a string s consisting only of lowercase English letters (a-z), determine whether s is a palindrome.

A palindrome reads the same forward and backward.

Input

• A single string s .

Output

• Return true if s is a palindrome; otherwise return false .

Constraints

• 1 <= |s| <= 2 * 10^5

Examples

• Input: s = "racecar" → Output: true
• Input: s = "hello" → Output: false