using System;

using System.Collections;
using System.Collections.Generic;
using System.Collections.Specialized;
using System.Text;
using System.Text.RegularExpressions;
using System.Linq;
using System.IO;

class Program
{
    static void Main(string[] args)
    {
        new Magatro().Solve();
    }
}

public class Scanner
{
    private StreamReader Sr;

    private string[] S;
    private int Index;
    private const char Separator = ' ';

    public Scanner(Stream source)
    {
        Index = 0;
        S = new string[0];
        Sr = new StreamReader(source);
    }

    private string[] Line()
    {
        return Sr.ReadLine().Split(Separator);
    }

    public string Next()
    {
        string result;
        if (Index >= S.Length)
        {
            S = Line();
            Index = 0;
        }
        result = S[Index];
        Index++;
        return result;
    }
    public int NextInt()
    {
        return int.Parse(Next());
    }
    public double NextDouble()
    {
        return double.Parse(Next());
    }
    public long NextLong()
    {
        return long.Parse(Next());
    }
    public decimal NextDecimal()
    {
        return decimal.Parse(Next());
    }
    public string[] StringArray(int index = 0)
    {
        Next();
        Index = S.Length;
        return S.Skip(index).ToArray();
    }
    public int[] IntArray(int index = 0)
    {
        return StringArray(index).Select(int.Parse).ToArray();
    }
    public long[] LongArray(int index = 0)
    {
        return StringArray(index).Select(long.Parse).ToArray();
    }
    public bool EndOfStream
    {
        get { return Sr.EndOfStream; }
    }
}

public class Magatro
{
    private Scanner Cin;

    private const long Mod = 1000000007;
    private int N;
    private int[] A;
    private void Scan()
    {
        Cin = new Scanner(Console.OpenStandardInput());
        N = Cin.NextInt();
        A = Cin.IntArray();
    }

    public void Solve()
    {
        Scan();
        long result = Conbination(N, 3);
        var map = new Dictionary<int, int>();
        int d;
        foreach (int i in A)
        {
            if (map.TryGetValue(i, out d))
            {
                map[i]++;
            }
            else
            {
                map.Add(i, 1);
            }
        }
        foreach (var p in map)
        {
            if (p.Value >= 3)
            {
                result +=(Mod- Conbination(p.Value, 3));
            }
            if (p.Value >= 2)
            {
                result +=(Mod- Conbination(p.Value, 2) * (N - p.Value));
            }
            result %= Mod;
        }
        Console.WriteLine(result);
    }

    private long Conbination(long n, long m)
    {
        long bunsi = MyMath.Factorial(n, Mod);
        long bunbo = (MyMath.Factorial(m, Mod) * MyMath.Factorial(n - m, Mod)) % Mod;
        return (bunsi * MyMath.MyPower(bunbo, Mod - 2, Mod))%Mod;
    }
}

static class MyMath
{
    static public long MyPower(long a, long b, long mod)
    {
        long result = 1;
        while (b > 0)
        {
            if (b % 2 == 1)
            {
                result *= a;
                result %= mod;
            }
            a *= a;
            a %= mod;
            b /= 2;
        }
        return result;
    }

    static public long Factorial(long l, long mod)
    {
        if (l == 0) return 1;
        return (Factorial(l - 1, mod) * l) % mod;
    }
}