#include <bits/stdc++.h>
using namespace std;
long long MOD[2];
long long X[2];
pair<long long, long long> f(char s[]) {
  long long i, l, j;
  pair<long long, long long> p;
  l = strlen(s);
  long long ans1, ans0;
  ans0 = s[0];
  ans1 = s[0];
  for (i = 1; i <= l - 1; i++) {
    ans0 = (ans0 * X[0] + s[i]) % MOD[0];
    ans1 = (ans1 * X[1] + s[i]) % MOD[1];
  }
  p.first = ans0;
  p.second = ans1;
  return p;
}
int main() {
  long long i, j, k;
  map<pair<long long, long long>, long long> m;
  pair<long long, long long> p;
  MOD[0] = 999999937;
  MOD[1] = 999999929;
  X[0] = 37;
  X[1] = 31;
  char s[25];
  char s1[25];
  scanf("%s", s);
  long long l = strlen(s);
  long long ans = 0;
  for (i = 0; i < l + 1; i++) {
    for (j = 0; j < 26; j++) {
      for (k = 0; k <= i - 1; k++) {
        s1[k] = s[k];
      }
      s1[i] = j + 'a';
      for (k = i + 1; k <= l; k++) {
        s1[k] = s[k - 1];
      }
      p = f(s1);
      if (m[p] == 0) {
        ans++;
        m[p]++;
      }
    }
  }
  printf("%lld\n", ans);
  return 0;
}
