#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0, length = n; i < length; i++)
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ep emplace
#define epb emplace_back
#define scll static_cast<long long> 
#define sz(x) static_cast<int>((x).size())
#define pfll(x) printf("%lld\n", x)
#define ci(x) cin >> x
#define ci2(x, y) cin >> x >> y
#define ci3(x, y, z) cin >> x >> y >> z
#define ci4(w, x, y, z) cin >> w >> x >> y >> z
#define co(x) cout << x << endl
#define co2(x, y) cout << x << " " << y << endl
#define co3(x, y, z) cout << x << " " << y << " " << z << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef priority_queue<int> PQ;
typedef priority_queue<int, vector<int>, greater<int>> PQG;
typedef priority_queue<P> PQP;
typedef priority_queue<P, vector<P>, greater<P>> PQPG;

const int MAX_N = 2e5, MOD = 1e9 + 7, INF = 1e9;
int n, a[MAX_N];
ll sum[MAX_N];

int main() {
    ci(n);
    rep(i, n) ci(a[i]);
    sort(a, a + n);
    rep(i, n) sum[i + 1] = sum[i] + a[i];
    double ans = 0.0;
    ans += -double(n % 2) * a[n / 2] / 2 / n +
        double(sum[n] - sum[n / 2]) / n;
    cout << fixed << setprecision(15) << ans << endl;
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
  ll a,b,c;
  cin >> a >> b >> c;
  ll p=998244353;
  ll ans=1;
  ll x=a*(a+1)/2,y=b*(b+1)/2,z=c*(c+1)/2;
  x%=p;
  y%=p;
  z%=p;
  ans=x;
  ans%=p;
  ans*=y;
  ans%=p;
  ans*=z;
  ans%=p;
  if(ans<0){
    ans+=p;
  }
  cout << ans;
}
  