codeforces1165E Two Arrays and Sum of Functions

https://codeforces.com/contest/1165/problem/E

You are given two arrays aa and bb, both of length nn.

Let's define a function f(l,r)=∑l≤i≤rai⋅bif(l,r)=∑l≤i≤rai⋅bi.

Your task is to reorder the elements (choose an arbitrary order of elements) of the array bb to minimize the value of ∑1≤l≤r≤nf(l,r)∑1≤l≤r≤nf(l,r). Since the answer can be very large, you have to print it modulo 998244353998244353. Note that you should minimize the answer but not its remainder.

Input

The first line of the input contains one integer nn (1≤n≤2⋅1051≤n≤2⋅105) — the number of elements in aa and bb.

The second line of the input contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤1061≤ai≤106), where aiai is the ii-th element of aa.

The third line of the input contains nn integers b1,b2,…,bnb1,b2,…,bn (1≤bj≤1061≤bj≤106), where bjbj is the jj-th element of bb.

Output

Print one integer — the minimum possible value of ∑1≤l≤r≤nf(l,r)∑1≤l≤r≤nf(l,r) after rearranging elements of bb, taken modulo 998244353998244353. Note that you should minimize the answer but not its remainder.

Examples

input

Copy

5
1 8 7 2 4
9 7 2 9 3

output

Copy

646

input

Copy

1
1000000
1000000

output

Copy

757402647

input

Copy

2
1 3
4 2

output

Copy

20

#include<bits/stdc++.h>
#define mod 998244353
using namespace std;
typedef long long ll;
const int maxn=2e5+5;
bool cmp(ll a,ll b){
    return a>b;
}
ll a[200005],b[200005];
int main()
{
    int n;
    cin>>n;
    ll sum=0;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        a[i]=a[i]*i*(n-i+1);
    }
    for(int i=1;i<=n;i++)
        cin>>b[i];

    sort(a+1,a+n+1);
    sort(b+1,b+n+1,cmp);

    for(int i=1;i<=n;i++)
    {
        sum=(sum+a[i]%mod*b[i]%mod)%mod;
    }
    cout<<sum;
}