Palindrome Rearrangement

Given a string s, determine whether its characters can be rearranged to form a palindrome.

A palindrome is a string that reads the same forward and backward. In order for a string to be rearranged into a palindrome, at most one character can appear an odd number of times. In other words, the following condition must be satisfied:

$$\text{Number of characters with odd count} \leq 1$$

If the condition is met, output Possible Palindrome; otherwise, output Not Possible Palindrome.

inputFormat

The input consists of a single line containing the string s. This string may contain any characters.

outputFormat

Output a single line containing either Possible Palindrome if the input string can be rearranged into a palindrome, or Not Possible Palindrome otherwise.

## sample

civic

Possible Palindrome