#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
	ios::sync_with_stdio(0);
	//freopen("in.txt","r",stdin);
	string str;
	while(cin>>str){
		int num[27]={0};
		ll ans=0;
		for(int i=0;i<str.size();i++){
			ans+=i-num[str[i]-'a'];
			num[str[i]-'a']++;
		}
		cout<<ans+1<<endl;
	}
}
### 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<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
	ios::sync_with_stdio(0);
	//freopen("in.txt","r",stdin);
	string str;
	while(cin>>str){
		int num[27]={0};
		ll ans=0;
		for(int i=0;i<str.size();i++){
			ans+=i-num[str[i]-'a'];
			num[str[i]-'a']++;
		}
		cout<<ans+1<<endl;
	}
}
```