#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=1e9+7;
ll powmod(ll a, ll k){
    ll ap=a, ans=1;
    while(k){
        if(k&1){
            ans*=ap;
            ans%=MOD;
        }
        ap=ap*ap;
        ap%=MOD;
        k>>=1;
    }
    return ans;
}
ll inv(ll a){
    return powmod(a, MOD-2);
}
int main()
{
	string s; cin>>s;
	int n=s.size();
	ll p2[200020];
	p2[0]=1;
	for(int i=0; i<n; i++) p2[i+1]=p2[i]*2%MOD;
	ll s1[26]={}, s2[26]={};
	for(int i=0; i<n; i++){
		(s2[s[i]-'a']+=s1[s[i]-'a']*p2[n-1-i])%=MOD;
		(s1[s[i]-'a']+=p2[i])%=MOD;
	}
	ll ans=0, sum=0;
	for(int i=0; i<n; i++){
		(ans+=sum*p2[n-1-i])%=MOD;
		(sum+=p2[i])%=MOD;
	}
	for(int i=0; i<26; i++){
		(ans+=MOD-s2[i])%=MOD;
	}
	ans=(ans+p2[n]-1)%MOD;
	cout<<ans<<endl;
	return 0;
}