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 C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Linq;


namespace AtC
{
    class Program
    {
        static void Main(string[] args)
        {
            var N = ulong.Parse(Console.ReadLine());
            var S = Console.ReadLine();

            ulong[] counts = new ulong['z' - 'a' + 1];

            foreach (var c in S)
            {
                counts[c - 'a']++;
            }

            var list = counts.Where(val => val != 0).ToList();

            ulong count = 0;
            ulong sum = 0;
            list.ForEach(val => { sum += val; });
            for (ulong i = 0; i < (ulong) list.Count; i++)
            {
                ulong s = 0;
                list.ForEach(val => s += Pow(val, i + 1));
                count += (Pow(sum, i + 1) - s) / Pow(2, i + 1);
                count %= 1000000007;
            }

            Console.WriteLine(count);
        }

        static ulong Pow(ulong val, ulong n)
        {
            if (n <= 1) return val;
            return val * Pow(val, n - 1);
        }
    }
}