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 <string>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    string s;
    cin>>s;

    int N = (int)s.size();
    vector<int> T(1<<26, N);
    T[0] = 0;

    int h = 0;
    for (int i=0; i<(int)s.size(); i++)
    {
        h ^= 1<<(s[i]-'a');
        int a = N;
        for (int i=0; i<26; i++)
            a = min(a, T[h^1<<i]+1);
        T[h] = min(T[h], a);
    }
    cout<<max(T[h], 1)<<endl;
}
