#include<cstdio>
#include<cstring>
long long cnt[200];
char s[300000];
int main()
{
	scanf("%s",s);
	long long n=strlen(s);
	for(int i=0;i<n;i++)cnt[s[i]]++;
	long long tot=0;
	for(int i='a';i<='z';i++)tot+=cnt[i]*(cnt[i]-1)/2;
	printf("%lld\n",n*(n-1)/2-tot+1);
}

### Prompt

Please create a solution in cpp 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<cstdio>
#include<cstring>
long long cnt[200];
char s[300000];
int main()
{
	scanf("%s",s);
	long long n=strlen(s);
	for(int i=0;i<n;i++)cnt[s[i]]++;
	long long tot=0;
	for(int i='a';i<='z';i++)tot+=cnt[i]*(cnt[i]-1)/2;
	printf("%lld\n",n*(n-1)/2-tot+1);
}

```