#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

int usiro[200200][26];
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	string S;
	cin >> S;

	const int mod = 1e9 + 7;
	int N = S.size();

	ll tmp = 1;
	rep(j, 26) usiro[N][j] = 1;
	for (int i = N - 1; i >= 0; i--) {
		rep(j, 26) {
			if (S[i] == 'a' + j) {
				usiro[i][j] = usiro[i + 1][j];
			}
			else {
				usiro[i][j] = (usiro[i + 1][j] + tmp) % mod;
			}
		}
		tmp = tmp * 2 % mod;
	}

	ll kotae = 0;
	tmp = 1;
	rep(i, N) {
		S[i] -= 'a';
		kotae += tmp * usiro[i][S[i]] % mod;
		tmp = tmp * 2 % mod;
	}

	co(kotae% mod);


	Would you please return 0;
}