#include <bits/stdc++.h>
using namespace std;
bool isprime[1000005 + 1];
long long fun[1000005 + 1];
long long a[1000005 + 1];
void callit() {
  memset(isprime, 1, sizeof(isprime));
  for (int i = 1; i < 1000005; i++) fun[i] = 1;
  int i, j;
  for (i = 2; i < 1000005; i++)
    if (isprime[i]) {
      for (j = 2 * i; j < 1000005; j += i) {
        isprime[j] = false;
        fun[j] += i;
      }
    }
  a[0] = 0;
  a[1] = 0;
  for (i = 2; i < 1000005; i++) a[i] = a[i - 1] + fun[i];
}
int main() {
  char ar[25];
  scanf("%s", ar);
  int a = strlen(ar) + 1;
  long long ans = 26 * (a)-a + 1;
  printf("%lld", ans);
}
