//String s = "aabc"所有子串的总数,包括“”,(“”,a,a,b,c,ab,ab,ac,ac,bc,abc,abc)
//从最后一个字母开始数
public class main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
while (in.hasNext()){
String s = in.next();
if(s.length()>=1&&s.length()<=1000000){
char[] ch = s.toCharArray();
int len = sunlen(ch);
System.out.print(len);
System.out.println();
}
}
}
public static int sunlen(char[] ch) {
int n = ch.length;
Set<Character> set = new HashSet<>();
List<Character> list = new ArrayList<>();
Map<Character, Integer> map = new HashMap<>();
int len = 1;
int i = 0;
while (i < n) {
if (!set.contains(ch[i])) {
set.add(ch[i]);
list.add(ch[i]);
} else {
if (!map.containsKey(ch[i])) {
map.put(ch[i], 1);
} else {
int count = map.get(ch[i]);
count++;
map.put(ch[i], count);
}
}
i++;
}
int[] arr = new int[list.size()];
int m = 0;
for (int k = list.size() - 1; k >= 0; k--) {
if (k == list.size()-1) {
arr[m] = 1;
if (map.containsKey(list.get(k))) {
int value = map.get(list.get(k));
len += value;
}
len += 1;
} else {
int sum = sumArr(arr, m - 1);
arr[m] = sum + 1;
if (map.containsKey(list.get(k))) {
int value = map.get(list.get(k));
len += value * arr[m];
}
len += arr[m];
}
m++;
}
return len%20210101;
}
public static int sumArr(int[] arr, int n){
int sum = 0;
for (int i=0;i<arr.length;i++){
sum += arr[i];
}
return sum;
}
}