#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long long
#define inf 1e18
#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)
#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define mod 1000000007

using namespace std;
typedef pair<llint, llint> P;

string s;
llint sum[200005][26];
llint beki[200005];

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> s;
	llint n = s.size();
	s = "#" + s;
	
	beki[0] = 1;
	for(int i = 1; i <= n; i++) beki[i] = beki[i-1] * 2 % mod;
	
	for(int i = 1; i <= n; i++){
		for(int j = 0; j < 26; j++){
			sum[i][j] = sum[i-1][j];
		}
		(sum[i][s[i]-'a'] += beki[i-1]) %= mod;
	}
	
	llint ans = 0;
	for(int i = 2; i <= n; i++){
		llint x = (beki[i-1] + mod - 1) % mod + mod - sum[i-1][s[i]-'a'];
		ans += beki[n-i] * (x % mod) % mod, ans %= mod;
	}
	ans += beki[n] + mod - 1, ans %= mod;
	cout << ans << endl;
	
	return 0;
}