#include <bits/extc++.h>

#ifndef DUMP
#define DUMP(...) (void)0
#endif

using namespace std;

template <class T, class Op = multiplies<T>>
constexpr T power(T a, long long n, Op op = Op(), T e = {1}) {
  assert(n >= 0);
  while (n) {
    if (n & 1) e = op(e, a);
    if (n >>= 1) a = op(a, a);
  }
  return e;
}

template <unsigned M>
struct modular {
  using m = modular;
  static constexpr unsigned mod = M;
  unsigned v;
  modular(long long x = 0) : v((x %= mod) < 0 ? x + mod : x) {}
  m operator-() const { return m() -= *this; }
  m& operator+=(m b) {
    if ((int)(v += b.v - mod) < 0) v += mod;
    return *this;
  }
  m& operator-=(m b) {
    if ((int)(v -= b.v) < 0) v += mod;
    return *this;
  }
  m& operator*=(m b) {
    v = (uint64_t)v * b.v % mod;
    return *this;
  }
  m& operator/=(m b) { return *this *= power(b, mod - 2); }
  friend m operator+(m a, m b) { return a += b; }
  friend m operator-(m a, m b) { return a -= b; }
  friend m operator*(m a, m b) { return a *= b; }
  friend m operator/(m a, m b) { return a /= b; }
  friend bool operator==(m a, m b) { return a.v == b.v; }
};

using mint = modular<power(10, 9) + 7>;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  string s;
  cin >> s;
  int n = size(s);
  vector<mint> v(26);
  for (int i = 0; i < n; ++i) {
    v[s[i] - 'a'] += 1 / power<mint>(2, i);
  }
  mint res;
  for (int i = 0; i < n; ++i) {
    v[s[i] - 'a'] -= 1;
    for (char c = 'a'; c <= 'z'; ++c) {
      if (c == s[i]) continue;
      res += v[c - 'a'];
    }
    res += 1 / power<mint>(2, n - i - 1);
    DUMP(res);
    for (auto&& e : v) e *= 2;
  }
  res *= power<mint>(2, n - 1);
  cout << res.v << '\n';
}