Palindrome Permutation

Given a string s, determine whether any permutation of its letters can form a palindrome. A palindrome is a string that reads the same forwards and backwards. In this problem, you should only consider alphabetic characters and ignore case. Formally, let freq(c) denote the frequency of character c (after converting the string to lowercase and ignoring non-letter characters); the string can form a palindrome if and only if

You are required to read input from standard input and output the result to standard output. The result should be the word True if the string is a permutation of a palindrome, and False otherwise.

inputFormat

The input consists of a single line containing the string s. The string may include spaces, punctuation, and both uppercase and lowercase letters.

outputFormat

Output a single word: True if any permutation of s can form a palindrome, otherwise False.

Tact Coa

True