#include<iostream>
#include<string>
using namespace std;
int main(){
 long long  cnt=1,h[200]={};
  string a;
  cin>>a;
  for(int i=0;i<a.size();i++)h[a[i]]++;
  for(int i=0;i<200;i++)for(int j=i+1;j<200;j++)if(i!=j)cnt+=h[i]*h[j];
  cout<<cnt;
  return 0;
}
### Prompt

Generate a Cpp solution to the following problem:

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>
#include<string>
using namespace std;
int main(){
 long long  cnt=1,h[200]={};
  string a;
  cin>>a;
  for(int i=0;i<a.size();i++)h[a[i]]++;
  for(int i=0;i<200;i++)for(int j=i+1;j<200;j++)if(i!=j)cnt+=h[i]*h[j];
  cout<<cnt;
  return 0;
}
```