#include<bits/stdc++.h>
#define ll long long
using namespace std;

const int N = 1e4 + 5;
const int K = 7;
const int A = 26;
const int M = 1e9 + 7;
int sLen;
string s;
int dp[N][K][2];

int solve(int idx, int mod, bool isSmall){
    if(idx == sLen){
        return (mod == 0);
    }
    if(dp[idx][mod][isSmall] != -1)
        return dp[idx][mod][isSmall];

    int ans = 0;
    int id = s[idx] - 'a';

    int maxId = id + 1;
    if(isSmall) maxId = A;

    for(int i = 0; i < maxId; i++){
        ans += solve(idx + 1, (mod + i) % K, isSmall | (i < id));
        if(ans >= M)
            ans -= M;
    }
    return dp[idx][mod][isSmall] = ans;
}
int main()
{
    ios_base ::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    cin >> s;

    sLen = (int)s.size();

    memset(dp, -1, sizeof(dp));
    cout << solve(0, 0, 0);
return 0;
}