We have a string s consisting of lowercase English letters. Snuke is partitioning s into some number of non-empty substrings. Let the subtrings obtained be s_1, s_2, ..., s_N from left to right. (Here, s = s_1 + s_2 + ... + s_N holds.) Snuke wants to satisfy the following condition:

* For each i (1 \leq i \leq N), it is possible to permute the characters in s_i and obtain a palindrome.



Find the minimum possible value of N when the partition satisfies the condition.

Constraints

* 1 \leq |s| \leq 2 \times 10^5
* s consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:


s


Output

Print the minimum possible value of N when the partition satisfies the condition.

Examples

Input

aabxyyzz


Output

2


Input

byebye


Output

1


Input

abcdefghijklmnopqrstuvwxyz


Output

26


Input

abcabcxabcx


Output

3
#include<iostream>
#include<map>
using namespace std;
string s;
int d[200001];
map<int,int> best;
int main()
{
	cin>>s;
	int n=s.size(),x=0;s=' '+s;
	best[0]=0;
	for(int i=1;i<=n;i++)
	{
		d[i]=i;
		x^=1<<(s[i]-'a');
		for(int j=0;j<26;j++)
			if(best.count(x^(1<<j)))d[i]=min(d[i],best[x^(1<<j)]+1);
		if(best.count(x))d[i]=min(d[i],best[x]),best[x]=min(best[x],d[i]);
		else best[x]=d[i];
	}
	cout<<max(1,d[n])<<endl;
	return 0;
}
