Smaug, the dragon, rules under The Mountain, Erabor which was originally the ruling place of Dwarf King. King Thorin, who is the rightful heir to the throne is on his way to take back his kingdom from Smaug. With the help of a map, King Thorin is able to find a secret entry into the mountain. But now when he has reached the door, he finds that the door has been sealed and can only be unlocked using a special key.


The key to unlock the door is a palindrome which is an anagram of a given word.


The king has a list of words. For each given word, can you help the king in figuring out if any anagram of it can be a palindrome or not?.


Input
A single line which will contain the input string

Output
A single line containing YES/NO in capital letter of english alphabet.

Constraints
1<=length of string <= 10^5 Each character of the string is a lowercase english alphabet.

Example
Input:

cdcdcdcdeeeef

Output:
YES
 

Explanation
One of the permutations of the given string which is a palindrome is ddcceefeeccdd .
lis=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
a=raw_input().strip()
leng=len(a)
count=0
if(leng%2==1):
	count+=1
flag=1
for i in lis:
	k=a.count(i)
	if(k%2==1):
		if(count>0):
			count-=1
		else:
			flag=0
			break
if(flag==1):
	print "YES"
else:
	print "NO"