#include<iostream>
using namespace std;
int main(){
char a[222222];
long i,c[1000],ans=0;
cin>>a;
for(i=0;i<1000;i++)
c[i]=0;
for(i=0;a[i]!='\0';i++){
ans-=c[a[i]];
c[a[i]]++;
}
ans+=i*(i-1)/2+1;
cout<<ans<<endl;
}
### Prompt

Please provide a Cpp coded solution to the problem described below:

You have a string A = A_1 A_2 ... A_n consisting of lowercase English letters.

You can choose any two indices i and j such that 1 \leq i \leq j \leq n and reverse substring A_i A_{i+1} ... A_j.

You can perform this operation at most once.

How many different strings can you obtain?

Constraints

* 1 \leq |A| \leq 200,000
* A consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:


A


Output

Print the number of different strings you can obtain by reversing any substring in A at most once.

Examples

Input

aatt


Output

5


Input

xxxxxxxxxx


Output

1


Input

abracadabra


Output

44

### Response

```cpp
#include<iostream>
using namespace std;
int main(){
char a[222222];
long i,c[1000],ans=0;
cin>>a;
for(i=0;i<1000;i++)
c[i]=0;
for(i=0;a[i]!='\0';i++){
ans-=c[a[i]];
c[a[i]]++;
}
ans+=i*(i-1)/2+1;
cout<<ans<<endl;
}
```