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;

#define REP(i, n) for ( int i = 0; i < (n); i++ )

int bit[1<<26];

signed main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  string s;
  cin >> s;

  int N = s.size();

  const int INF = 1e9;
  fill_n(bit, 1<<26, INF);
  bit[0] = 0;
  int now = 0;
  for ( int i = 0; i < N; i++ ) {
    now ^= (1<<(s[i]-'a'));
    for ( int j = 0; j < 26; j++ ) {
      int b = now ^ (1<<j);
      bit[now] = min(bit[now], bit[b]+1);
    }
  }

  cout << max(1, bit[now]) << endl;

  return 0;
}
