#include<bits/stdc++.h>
using namespace std;
const int N=105;
string s="tocyjkdzcieoiodfpbgcncsrjbhmugdnojjddhllnofawllbhfiadgdcdjstemphmnjihecoapdjjrprrqnhgccevdarufmliqijgihhfgdcmxvicfauachlifhafpdccfseflcdgjncadfclvfmadvrnaaahahndsikzssoywakgnfjjaihtniptwoulxbaeqkqhfwl";
int len;
int f[N];
int g[N];
int main(){
len=s.length();
for(int i=0;i<len;i++) f[i]=1;
for(int i=0;i<len;i++){
for(int j=0;j<i;j++){
if(s[i]==s[j]){
g[i]=0;//只统计上一次出现s[i]到i的部分
}else if(s[i]>s[j]){
g[i]+=g[j];
}
}
}
int res=0;
for(int i=0;i<len;i++){
res+=g[i];
}
cout<<res;
}