#include <cstdio>
#include <cstdlib>
#include <fstream>

using namespace std;

#define MOD 123457

int N, x, V[ 500010 ];
long long S, i;

int sortf( const void *x, const void *y ) {
	return *(int *)x - *(int *)y;
}

int main() {
	ifstream fi( "algsort.in" );
	ofstream fo( "algsort.out" );

	fi >> N;
	for( i = 1; i <= N; i++ )
		fi >> V[i];

	qsort( V+1, N, sizeof( V[1] ), sortf );

	for( S = 0, i = 1; i <= N; i++ )
		S = ( S + i*V[i] ) % MOD;

	fo << S << '\n';

	fo.close(); fi.close();

	return 0;
}