#include <bits/stdc++.h>

#define rep(i, n) for (int (i) = 0; (i) < (int)(n); (i)++)

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;

const ll MOD = 573;
const int MAXN = 1024;
ll cmb[MAXN][MAXN];

void init() {
    cmb[0][0] = 1;
    for (int i = 1; i < MAXN; i++) {
        cmb[i][0] = 1;
        for (int j = 1; j <= i; j++) {
            cmb[i][j] = (cmb[i-1][j] + cmb[i-1][j-1]) % MOD;
        }
    }
}

int main() {
    init();
    string s;
    cin >> s;
    int n = s.size();
    map<char, int> m;
    for (char c : s) {
        m[c]++;
    }
    ll ans = 1;
    for (auto el : m) {
        ans *= cmb[n][el.second];
        n -= el.second;
        ans %= MOD;
    }
    cout << (ans-1+MOD)%MOD << endl;
    return 0;
}