#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <iomanip>
#include <map>
using namespace std;
typedef long long LL;

const LL MOD=1000000007;

LL mod_comb(LL n, LL m){
    vector<vector<LL> > dp(n+1, vector<LL>(m+1));
    dp[0][0] = 1;
    for(int i = 0; i < n; i++){
        for(int j = 0; j <= m; j++){
            dp[i+1][j] += dp[i][j];
            dp[i+1][j] %= MOD;
        }
        for(int j = 0; j < m; j++){
            dp[i+1][j+1] += dp[i][j];
            dp[i+1][j+1] %= MOD;
        }
    }
    return dp[n][m];
}

int main(){
    string s;
    cin >> s;
    map<int,int> cnt;
    for(int i = 0; i < s.size(); i++){
        cnt[s[i]]++;
    }
    int rest = s.size();
    LL ans = 1;
    for(auto& p : cnt){
        ans *= mod_comb(rest, p.second);
        ans %= MOD;
        rest -= p.second;
    }
    cout << (ans+MOD-1)%MOD << endl;
    return 0;
}