You are given a string S of length N. Among its subsequences, count the ones such that all characters are different, modulo 10^9+7. Two subsequences are considered different if their characters come from different positions in the string, even if they are the same as strings.  Here, a subsequence of a string is a concatenation of **one or more** characters from the string without changing the order.
N = int(input())
S = input()
a = 1
for c in [chr(i) for i in range(97, 123)]:
    a = (a * (S.count(c) + 1)) % (1e9 + 7)
print((a - 1) % (1e9 + 7))

N = int(input())
S = input()
a = 1
for c in [chr(i) for i in range(97, 123)]:
    a = (a * (S.count(c) + 1)) % (1e9 + 7)
print(int((a - 1) % (1e9 + 7)))
