import java.util.Arrays;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeMap;

public class Main {
	
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		
		final int N = sc.nextInt();
		final long MOD = 1000000009;
		
		Map<Long, Integer> counts = new TreeMap<Long, Integer>();
		
		for(int i = 0; i < N; i++){
			final long L = sc.nextLong();
			
			if(!counts.containsKey(L)){
				counts.put(L, 0);
			}
			counts.put(L, counts.get(L) + 1);
		}
		
		long[] count_array = new long[counts.size()];
		{
			int i = 0;
			for(final Entry<Long, Integer> entry : counts.entrySet()){
				count_array[i] = entry.getValue();
				
				i++;
			}
		}
		long[] sum_array = new long[count_array.length];
		for(int i = 1; i < count_array.length; i++){
			sum_array[i] = sum_array[i - 1] + count_array[i - 1];
		}
		long[] sum_array_rev = new long[count_array.length];
		for(int i = count_array.length - 2; i >= 0; i--){
			sum_array_rev[i] = sum_array_rev[i + 1] + count_array[i + 1];
		}
		
		long answer = 0;
		for(int i = 0; i < count_array.length; i++){
			answer += count_array[i] * sum_array[i] * sum_array_rev[i];
			answer %= MOD;
		}
		
		System.out.println(answer);
		
	}
	
}