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 <bits/stdc++.h>
using namespace std;
int freq[200005],dp[200005],i,j;
unordered_map<int,int> best;
#define get(k) (best.find(k)!=best.end()?best[k]:dp[i-1])
int main(){
	ios_base::sync_with_stdio(0);
	string s;
	cin>>s;
	for(int i=0;i<s.size();++i)
		freq[i+1]=freq[i]^(1<<(s[i]-'a'));
	for(best[0]=0,i=1;i<=s.size();++i){
		for(dp[i]=1+get(freq[i]),j=26;j--;dp[i]=min(dp[i],1+get(freq[i]^(1<<j))));
		if(best.find(freq[i])==best.end() || best[freq[i]]>dp[i]) best[freq[i]]=dp[i];
	}
	cout<<dp[s.size()];
}