#include<bits/stdc++.h>
using namespace std;

#define _BIGINT_MAXN_H_ 100000

struct BigInt{
	char num[_BIGINT_MAXN_H_];
	int len;
	bool neg;
	
	BigInt(){
		memset(num,0,sizeof num);
		len = 0, neg = 0;
	}
}ans,n26;

string s;
string wd = " abcdefghijklmnopqrstuvwxyz";

void read(BigInt&);
void write(const BigInt&);
void del0(BigInt&);
BigInt abs(const BigInt&);
BigInt toBigInt(int);
bool operator < (const BigInt&,const BigInt&);
BigInt operator + (const BigInt&,const BigInt&);
BigInt operator - (const BigInt&,const BigInt&);
BigInt operator - (const BigInt&);
BigInt operator * (const BigInt&,const BigInt&);

int main(){
	cin >> s;
	
	ans.len = 1;
	n26 = toBigInt(26);
	for(int i = 0; i < int(s.size()); i++){
		ans = ans * n26;
		ans = ans + toBigInt(wd.find(s[i]));
	}
	
	write(ans);
	
	return 0;
}

void read(BigInt& n){
	while(n.num[0] = getchar(), !isdigit(n.num[0]) && n.num[0] != '-'){};
	if(n.num[0] == '-')
		n.neg = 1, n.num[0] = getchar();
	while(isdigit(n.num[n.len])){
		n.num[n.len] ^= 48;
		n.num[++n.len] = getchar();
	}
	n.num[n.len] = 0;
	reverse(n.num, n.num + n.len);
}
void write(const BigInt& n){
	if(n.len <= 1 && !n.num[0]){
		printf("0\n");
		return;
	}
	if(n.neg)
		putchar('-');
	for(int i = n.len-1; i >= 0; i--)
		putchar(n.num[i] | 48);
	putchar('\n');
}
void del0(BigInt& n){
	while(n.len > 1 && !n.num[n.len-1])
		n.len--;
}
BigInt abs(const BigInt& n){
	BigInt x = n;
	x.neg = 0;
	return x;
}
BigInt toBigInt(int n){
	BigInt x;
	while(n){
		x.num[x.len++] = n % 10;
		n /= 10;
	}
	return x;
}
bool operator < (const BigInt& a,const BigInt& b){
	if(a.neg != b.neg)
		return a.neg;
	if(a.neg){
		if(a.len != b.len)
			return a.len < b.len;
		for(int i = a.len-1; i >= 0; i--){
			if(a.num[i] != b.num[i])
				return a.num[i] > b.num[i];
		}
	}
	else{
		if(a.len != b.len)
			return a.len < b.len;
		for(int i = a.len-1; i >= 0; i--){
			if(a.num[i] != b.num[i])
				return a.num[i] < b.num[i];
		}
	}
	return 0;
}
BigInt operator + (const BigInt& a,const BigInt& b){
	if(a.neg != b.neg){
		if(a.neg){
			BigInt tmp = a;
			tmp.neg = 0;
			return b - tmp;
		}
		else{
			BigInt tmp = b;
			tmp.neg = 0;
			return a - tmp;
		}
	}
	BigInt c;
	c.len = max(a.len,b.len), c.neg = a.neg;
	int m = 0;
	for(int i = 0; i < c.len; i++){
		m += a.num[i] + b.num[i];
		c.num[i] = m % 10;
		m /= 10;
	}
	if(m)
		c.num[c.len++] = m;
	return c;
}
BigInt operator - (const BigInt& a){
	BigInt x = a;
	x.neg = !x.neg;
	return x;
}
BigInt operator - (const BigInt& a,const BigInt& b){
	BigInt c;
	if(b.neg){
		BigInt tmp = b;
		tmp.neg = 0;
		return a + tmp;
	}
	if(a < b){
		c = b - a;
		c.neg = 1;
		return c;
	}
	bool brw = 0;
	c.len = max(a.len,b.len);
	for(int i = 0; i < c.len; i++){
		c.num[i] = a.num[i] - b.num[i] - brw;
		if(c.num[i] < 0)
			c.num[i] += 10, brw = 1;
		else
			brw = 0;
	}
	del0(c);
	return c;
}
BigInt operator * (const BigInt& a,const BigInt& b){
	BigInt c;
	c.len = a.len + b.len, c.neg = a.neg ^ b.neg;
	for(int i = 0; i < a.len; i++){
		for(int j = 0; j < b.len; j++){
			c.num[i+j] += a.num[i] * b.num[j];
			c.num[i+j+1] += c.num[i+j] / 10;
			c.num[i+j] %= 10;
		}
	}
	del0(c);
	return c;
}