#include <cstdio>

#include <algorithm>

#define N 300010

#define mod 19260817

using namespace std;

int n , a[N] , v[N];

struct bit

{

	int f[N];

	inline void add(int x , int a)

	{

		int i;

		for(i = x ; i <= n ; i += i & -i) f[i] = (f[i] + a + mod) % mod;

	}

	inline int query(int x)

	{

		int i , ans = 0;

		for(i = x ; i ; i -= i & -i) ans = (ans + f[i]) % mod;

		return ans;

	}

}A , B;

int main()

{

	int i , ans = 0;

	scanf("%d" , &n);

	for(i = 1 ; i <= n ; i ++ ) scanf("%d" , &a[i]) , v[i] = a[i];

	sort(v + 1 , v + n + 1);

	for(i = 1 ; i <= n ; i ++ ) a[i] = lower_bound(v + 1 , v + n + 1 , a[i]) - v;

	for(i = 1 ; i <= n ; i ++ ) v[i] %= mod;

	for(i = 2 ; i <= n ; i ++ ) B.add(n - a[i] + 1 , v[a[i]]);

	for(i = 2 ; i <= n ; i ++ ) B.add(n - a[i] + 1 , -v[a[i]]) , A.add(a[i - 1] , v[a[i - 1]]) , ans = (ans + (long long)A.query(a[i] - 1) * B.query(n - a[i]) % mod * v[a[i]]) % mod;

	printf("%d\n" , ans);

	return 0;

}