You are given a string s consisting of uppercase and lowercase English letters.
Your task is to determine the maximum possible length of a palindrome that can be formed using the letters of the string.
Note that letters are case-sensitive — for example, 'A' and 'a' are different characters.

The first line contains a string s.

The string consists of English letters ('a'–'z', 'A'–'Z') only.

\(1<=|s|<=10^5\)

Print a single integer — the length of the longest palindrome that can be built using the letters of s.

Input copy	Output copy
abccccdd	7

Input copy	Output copy
Aa	1

A palindrome reads the same backward as forward.
You can rearrange the letters of the given string to form the palindrome.