#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep2(i, m, n) for(int i=int(m); i<int(n); ++i)
#define rep(i, n) rep2(i, 0, n)
const int MOD  = int(1e9)+7;


struct mint {
  ll x;
  mint(ll x=0) : x((x%MOD+MOD)%MOD) {}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) { if ((x += a.x) >= MOD) x -= MOD; return *this; }
  mint& operator-=(const mint a) { if ((x -= a.x) < 0) x += MOD; return *this; }
  mint operator+(const mint a) const { return mint(*this) += a; }
  mint operator-(const mint a) const { return mint(*this) -= a; }
};
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }


int main() {
  const int M = 26;
  string s; cin >> s;
  int n = s.size();

  int N = 1<<n;
  mint ans = 0;
  rep2(S, 1, N) {
    string t;
    rep(i, n) if (S>>i&1) t.push_back(s[i]);
    rep(i, t.size()-1) ans += (t[i] != t[i+1]);
    ans += 1;
  }
  cout << ans << "\n";
  return 0;
}