#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b, long long m = 1000000007) {
  if (b == 0) return 1;
  if (b == 1) return a;
  long long res = power(a, b / 2, m);
  res = (res * res) % m;
  if (b & 1) res = (res * a) % m;
  return res;
}
long long modinv(long long a, long long m = 1000000007) {
  return power(a, m - 2, m);
}
long long add(long long a, long long b, long long m = 1000000007) {
  long long c = (a % m + b % m);
  if (c >= m) c -= m;
  return c;
}
long long sub(long long a, long long b, long long m = 1000000007) {
  long long c = (a % m - b % m);
  if (c < 0) c += m;
  return c;
}
long long mul(long long a, long long b, long long m = 1000000007) {
  return (a * b) % m;
}
vector<long long> g[26];
void solve() {
  string s;
  cin >> s;
  long long i, j, n = s.length(), a[26];
  memset(a, 0, sizeof(a));
  long long cnt = 0;
  for (i = 0; i < n; i++) {
    a[s[i] - 'a']++;
    if (a[s[i] - 'a'] == 1) cnt++;
    g[s[i] - 'a'].push_back(i);
  }
  cout << cnt << "\n";
  long long ans[cnt + 1];
  memset(ans, 0, sizeof(ans));
  for (i = 0; i < n; i++) {
    vector<long long> v;
    for (j = 0; j < 26; j++) {
      long long x = lower_bound(g[j].begin(), g[j].end(), i) - g[j].begin();
      if (x == g[j].size()) continue;
      v.push_back(g[j][x]);
    }
    sort(v.begin(), v.end());
    for (j = 1; j < v.size(); j++) ans[j] += v[j] - v[j - 1];
    ans[j] += n - v[j - 1];
  }
  for (auto x : ans)
    if (x) cout << x << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t = 1;
  for (long long i = 1; i <= t; i++) {
    solve();
  }
  return 0;
}
