Problem:
Score : 200 points

Problem Statement

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.

Constraints

1 \leq N \leq 100000

S consists of lowercase English letters.

|S|=N

Input

Input is given from Standard Input in the following format:

N
S

Output

Print the number of the subsequences such that all characters are different, modulo 10^9+7.

Sample Input 1

4
abcd

Sample Output 1

15

Since all characters in S itself are different, all its subsequences satisfy the condition.

Sample Input 2

3
baa

Sample Output 2

5

The answer is five: b, two occurrences of a, two occurrences of ba. Note that we do not count baa, since it contains two as.

Sample Input 3

5
abcab

Sample Output 3

17

Solution in Python (3.4.3) (judge verdict: Wrong Answer)

N = int(input())
S = input()

L = []
for i in range(len(S)):
  if len(L) == 0:
    L.append([S[i], 2])
  else:
    u = 0
    for j in range(len(L)):
      if S[i] == L[j][0]:
        L[j][1] += 1
        u += 1
    if u == 0:
      L.append([S[i], 2])
p = 1    
for l in range(len(L)):
  p *= L[l][1]
print(p - 1)