Ositus

from collections import defaultdict, deque
from string import ascii_lowercase

s = input()

end = len(s)
maxnb = [end for _ in range(end)]
maxnb.append(-1)

minimum = end

def default():
    return minimum

def def2():
    return -1

seen = {ascii_lowercase[i]: end for i in range(26)}

for i in range(end-1, -1, -1):
    minimum = min(minimum, seen[s[i]])
    # maxnb[i] = seen[s[i]]
    maxnb[i] = minimum
    seen[s[i]] = i

val = {i: 0 for i in range(end+1)}
val[0] = 1


def getval(x):
    if val[x]:
        return val[x]

    value = 0
    for i in range(first[maxdist], x):
        value += getval(i)

    val[x] = value

    return value

ans = 0

first = {i: 0 for i in range(end+1)}

distances = deque()
distances.append(0)
prevdist = 0

ans = 0
for i in range(end+1):
    curdist = maxnb[i]

    maxdist = distances[0]
    if maxdist < i:
        distances.popleft()
        maxdist = distances[0]

    if curdist > prevdist:
        distances.append(curdist)
        first[curdist] = i

    prevdist = curdist


    getval(i)

MOD = 10**9 + 7


print(val[end])
# print(int(getval(end, -1) % MOD))

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 2, 3

Verdict: WRONG ANSWER

Test 6

Group: 3

Verdict: WRONG ANSWER

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED