import java.io.*; import java.util.*; public class Main { static final int MOD = 573; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); char[] values = sc.next().toCharArray(); HashMap all = getMap(values.length); int[] counts = new int[26]; for (char c : values) { counts[c - 'A']++; } for (int x : counts) { HashMap part = getMap(x); for (int y : part.keySet()) { all.put(y, all.get(y) - part.get(y)); } } int ans = 1; for (int x : all.keySet()) { ans *= pow(x, all.get(x)); ans %= MOD; } System.out.println((ans + MOD - 1) % MOD); } static HashMap getMap(int x) { HashMap ans = new HashMap<>(); for (int i = 2; i <= x; i++) { int y = i; for (int j = 2; j <= Math.sqrt(y); j++) { while (y % j == 0) { ans.put(j, ans.getOrDefault(j, 0) + 1); y /= j; } } if (y > 1) { ans.put(y, ans.getOrDefault(y, 0) + 1); } } return ans; } static int pow(int x, int p) { if (p == 0) { return 1; } else if (p % 2 == 0) { return pow(x * x % MOD, p / 2); } else { return pow(x, p - 1) * x % MOD; } } static int check(int idx, ArrayList list) { if (idx < 0) { return 0; } ArrayList odd = new ArrayList<>(); ArrayList ev = new ArrayList<>(); for (int x : list) { if ((x & (1 << idx)) == 0) { ev.add(x); } else { odd.add(x); } } if (ev.size() == 0) { return check(idx - 1, odd); } else if (odd.size() == 0) { return check(idx - 1, ev); } else { return Math.min(check(idx - 1, odd), check(idx - 1, ev)) + (1 << idx); } } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }