#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
#include <random>
#include <unordered_map>
#include <unordered_set>
#define all(a) a.begin(),a.end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pb push_back
#define debug(x) cerr << #x << ':' << (x) << '\n'
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef complex<ld> com;
constexpr int inf = 1000000010;
constexpr ll INF = 1000000000000000010;
constexpr ld eps = 1e-12;
constexpr ld pi = 3.141592653589793238;
template<class T, class U> inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; }

constexpr ll mod = 1000000007;
vector<ll> fac, inv, facinv;

void modcalc(int n) {
	fac.resize(n); inv.resize(n); facinv.resize(n);
	fac[0] = 1; fac[1] = 1; inv[1] = 1;
	facinv[0] = 1; facinv[1] = 1;
	for (ll i = 2; i < n; i++) {
		fac[i] = fac[i - 1] * i % mod;
		inv[i] = mod - inv[mod % i] * (mod / i) % mod;
		facinv[i] = facinv[i - 1] * inv[i] % mod;
	}
}

ll modinv(ll a) {
	a %= mod;
	if (a == 0) abort();
	if (a < (ll)inv.size()) return inv[a];
	ll b = mod, u = 1, v = 0;
	while (b) {
		ll t = a / b;
		a -= t * b; swap(a, b);
		u -= t * v; swap(u, v);
	}
	u %= mod;
	if (u < 0) u += mod;
	return u;
}

ll modpow(ll a, ll b, ll m = mod) {
	ll ans = 1;
	a %= m;
	while (b) {
		if (b & 1) ans = ans * a % m;
		a = a * a % m;
		b >>= 1;
	}
	return ans;
}

ll modcomb(ll n, ll k) {
	if (n < 0 || k < 0 || n < k) return 0;
	return fac[n] * facinv[k] % mod * facinv[n - k] % mod;
}

ll modperm(ll n, ll k) {
	if (n < 0 || k < 0 || n < k) return 0;
	return fac[n] * facinv[n - k] % mod;
}

ll modhom(ll n, ll k) {
	if (n < 0 || k < 0 || n == 0 && k > 0) return 0;
	if (n == 0 && k == 0) return 1;
	return fac[n + k - 1] * facinv[k] % mod * facinv[n - 1] % mod;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout << fixed << setprecision(20);

	string s;
	cin >> s;
	int n = s.size();
	ll ans = 0;
	rep(i, 26) {
		vector<P> vec;
		char c = 'a' + i;
		int tmp = 0;
		bool flag = true;
		rep(j, n) {
			if (flag == (s[j] == c)) {
				tmp++;
			}
			else {
				if (tmp) vec.pb({ tmp,flag });
				tmp = 1;
				flag = !flag;
			}
		}
		vec.pb({ tmp,flag });
		int sz = vec.size();
		vector<vector<ll>> cnt(sz + 1, vector<ll>(2));
		vector<vector<ll>> dp(sz + 1, vector<ll>(2));
		cnt[0][0] = 1;
		rep(i, sz) {
			int v = vec[i].first;
			if (vec[i].second) {
				cnt[i + 1][0] = cnt[i][0];
				cnt[i + 1][1] = cnt[i][0] * (modpow(2, v) - 1) + cnt[i][1] * modpow(2, v);
				cnt[i + 1][1] %= mod;
				dp[i + 1][0] = dp[i][0];
				dp[i + 1][1] = dp[i][1] * modpow(2, v);
				dp[i + 1][1] += (dp[i][0] + cnt[i][0])*(modpow(2, v) - 1);
				dp[i + 1][1] %= mod;
			}
			else {
				cnt[i + 1][1] = cnt[i][1];
				cnt[i + 1][0] = cnt[i][1] * (modpow(2, v) - 1) + cnt[i][0] * modpow(2, v);
				cnt[i + 1][0] %= mod;
				dp[i + 1][1] = dp[i][1];
				dp[i + 1][0] += dp[i][0] * modpow(2, v);
				dp[i + 1][0] += dp[i][1] * (modpow(2, v) - 1);
				dp[i + 1][0] %= mod;
			}
		}
		ans += dp[sz][0] + dp[sz][1];
	}
	cout << ans % mod << '\n';
}