#include <fstream>
#include <vector>
#include <algorithm>
#include <cassert>

using namespace std;

#define MOD 23456789
#define pb push_back

vector< int > V;
int N, x;
long long S, i;

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

	fi >> N;
	for( i = 1; i <= N; i++ ) {
		fi >> x;
		V.pb( x );
	}

	make_heap( V.begin(), V.end() );
	sort_heap( V.begin(), V.end() );
	
	for( S = i = 0; i < N; i++ )
		S = ( S + (i+1) * V[i] ) % MOD;

	fo << S << '\n';

	fi.close(); fo.close();
	return 0;
}