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<cstdio>
#include<cstring>
#define mem(a,p) memset(a,p,sizeof(a))
const int N=2e5+10,M=1<<26;
char ch[N];
int f[N],len,g[M];
int ss[N];
int min(int x,int y){return x>y?y:x;}
int main(){
	mem(g,127);
	scanf("%s",ch+1);
	len=strlen(ch+1);
	for(int i=1;i<=len;i++)ss[i]=ss[i-1]^(1<<(ch[i]-'a'));
	g[0]=0;
	for(int i=1;i<=len;i++){
		f[i]=g[ss[i]]+1;
		for(int j=0;j<=25;j++)
			f[i]=min(f[i],g[ss[i]^(1<<j)]+1);
		g[ss[i]]=min(f[i],g[ss[i]]);
	}
	printf("%d",f[len]);
	return 0;
}