#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cctype>
#include <string>
#include <cstring>

using namespace std;

typedef long long ll;

bool compare(const long double a, const long double b) {
  return fabsl(a) < fabsl(b);
}

int main() {
  int n;
  cin >> n;
  long double a[n], b[n];
  long double ans = 0;
  long double c = 0.;
  long double x, t, y, sum = 0;
  for (int i = 0; i < n; i++) {
    cin >> a[i];    
  }

  sort(a, a+n);
  sum = a[0];
  for (int i = 1; i < n; i++) {
    y = a[i]-c;
    t = sum+y;
    c = (t-sum)-y;
    sum = t;
  }
  cout << fixed << setprecision(10) << sum << endl;

}