Given a linked list, you are asked to check if it’s a palindrome. A palindrome is a sequence of items that’s the same if processed from the start and the end (abacaba or abccba).
Input
The initial data for the linked list is obtained automatically. You don’t need to do anything. It’s guaranteed that the size of the linked list does not exceed 1000 and the values in the linked list are all Latin lowercase letters.
Output
The program should print Yes if the linked list is a palindrome and No otherwise.