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>
#include<algorithm>
using namespace std;

const int N = 200010;
const int INF = 1e9;
int n;
int f[(1<<26)+10];
char s[N];

int main()
{
	scanf("%s", s+1); n = strlen(s+1);
	for (int i = 1; i < 1<<26; i ++){
		//if (__builtin_popcount(i) <= 1) f[i] = 1;
		f[i] = INF;
	}
	int st = 0, lst;
	for (int i = 1; i <= n; i ++){
		lst = st;
		st ^= 1<<s[i]-'a';
		f[st] = min(f[st], f[lst]+1);
		for (int j = 0; j < 26; j ++)
			f[st] = min(f[st], f[st^(1<<j)]+1);
	}
	if (!st) puts("1");
	else printf("%d\n", f[st]);
	return 0;
}