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

const int Q=200007;

char v[Q];
int n;

int mp[1<<26];



int main()
{
	//freopen("data.in", "r", stdin);

	cin>>v+1;
	n=strlen(v+1);

	mp[0]=1;

	int act=0;

	int best;

	for(int i=1; i<=n; i++)
	{
		act^=(1<<(v[i]-'a'));

		best=i;

		if(mp[act]!=0)
			best=mp[act];

		for(int poz=0; poz<26; poz++)
		{
			if(mp[act^(1<<poz)] < best && mp[act^(1<<poz)]!=0)
				best=mp[act^(1<<poz)];
		}
		if(mp[act]==0 || mp[act] > best+1)
			mp[act]=best+1;
	}

	cout<<best;


	return 0;
}