#include <iostream>
#include <string.h>
using namespace std;
char c[200001];
long tmp,a[27],all,ans,longs;
int main()
{
	cin>>c;
	longs=strlen(c);
	for(int i=0;i<longs;i++)
	{
		tmp=c[i]-'a';
		ans+=all-a[tmp];
		all++,a[tmp]++;
	}
	cout << ans+1<<"\n";
}
### Prompt

Your task is to create 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.h>
using namespace std;
char c[200001];
long tmp,a[27],all,ans,longs;
int main()
{
	cin>>c;
	longs=strlen(c);
	for(int i=0;i<longs;i++)
	{
		tmp=c[i]-'a';
		ans+=all-a[tmp];
		all++,a[tmp]++;
	}
	cout << ans+1<<"\n";
}
```