Problem: You generate real numbers s1, s2, ..., sn as follows: 

  * s0 = 0; 
  * si = si - 1 + ti, where ti is a real number chosen independently uniformly at random between 0 and 1, inclusive. 



You are given real numbers x1, x2, ..., xn. You are interested in the probability that si ≤ xi is true for all i simultaneously.

It can be shown that this can be represented as <image>, where P and Q are coprime integers, and <image>. Print the value of P·Q - 1 modulo 998244353.

Input

The first line contains integer n (1 ≤ n ≤ 30).

The next n lines contain real numbers x1, x2, ..., xn, given with at most six digits after the decimal point (0 < xi ≤ n).

Output

Print a single integer, the answer to the problem.

Examples

Input

4
1.00
2
3.000000
4.0


Output

1


Input

1
0.50216


Output

342677322


Input

2
0.5
1.0


Output

623902721


Input

6
0.77
1.234567
2.1
1.890
2.9999
3.77


Output

859831967

Note

In the first example, the sought probability is 1 since the sum of i real numbers which don't exceed 1 doesn't exceed i.

In the second example, the probability is x1 itself.

In the third example, the sought probability is 3 / 8.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MAX_DEG = 20, EXP_MULT = 119ULL, EXP = 23;
unsigned long long NTTMod = (EXP_MULT << EXP) + 1, NTTBuild[1 << MAX_DEG][2],
                   tempPVPoly[1 << MAX_DEG], rt[(1 << MAX_DEG) + 1];
unsigned long long modPow(unsigned long long a, unsigned long long p) {
  if (!p) return 1;
  if (p & 1) return a * modPow(a, p ^ 1) % NTTMod;
  unsigned long long sqrt = modPow(a, p >> 1);
  return (sqrt) * (sqrt) % NTTMod;
}
struct Polynomial {
  int deg;
  unsigned long long *coefficients;
  static unsigned long long findCyclic() {
    vector<int> multFactors;
    unsigned long long temp = EXP_MULT;
    for (int i = 2; i * i <= temp; i += 2) {
      if (temp % i == 0) multFactors.push_back(i);
      while (temp % i == 0) temp /= i;
      if (i == 2) i--;
    }
    if (temp > 1) multFactors.push_back(temp);
    for (int i = (2); i < (NTTMod); i++) {
      bool works = 1;
      if (modPow(i, NTTMod >> 1) == 1) works = 0;
      for (const int factor : multFactors)
        if (modPow(i, NTTMod / factor) == 1) works = 0;
      if (works) return i;
    }
    return -1;
  }
  static void buildRT() {
    if (rt[0] == 1) return;
    rt[0] = 1;
    rt[1] = modPow(findCyclic(), EXP_MULT << (EXP - MAX_DEG));
    for (int i = (2); i < ((1 << MAX_DEG) + 1); i++)
      rt[i] = rt[i - 1] * rt[1] % NTTMod;
  }
  Polynomial(const Polynomial &p) {
    deg = p.deg;
    coefficients = new unsigned long long[deg + 1];
    for (int i = 0; i < (p.deg + 1); i++) coefficients[i] = p.coefficients[i];
  }
  Polynomial(int d = 0) {
    deg = d;
    coefficients = new unsigned long long[deg + 1];
    memset(coefficients, 0, (deg + 1) * sizeof(unsigned long long));
    buildRT();
  }
  Polynomial apply(Polynomial p) {
    Polynomial curr;
    curr.coefficients[0] = 1;
    Polynomial res;
    for (int i = 0; i < (deg + 1); i++) {
      res += curr * coefficients[i];
      curr *= p;
    }
    return res;
  }
  void NTT(int neededDeg) {
    for (int i = (neededDeg + 1) - 1; i >= 0; i--) {
      int arr = i & 1, narr = arr ^ 1, lli = 1 << i, llil = lli << 1,
          llndim1 = 1 << (neededDeg - i - 1),
          rtp = lli << (MAX_DEG - neededDeg);
      if (i == neededDeg) {
        for (int j = 0; j < (deg + 1); j++) NTTBuild[j][arr] = coefficients[j];
        for (int j = (deg + 1); j < (lli); j++) NTTBuild[j][arr] = 0;
      } else
        for (int j = 0; j < (lli); j++) {
          int x = j, y = 0, z = j, w = j + lli;
          for (int k = 0; k < (llndim1); k++) {
            NTTBuild[x][arr] =
                (NTTBuild[z][narr] + NTTBuild[w][narr] * rt[y]) % NTTMod;
            x += lli, y += rtp, z += llil, w += llil;
          }
          z = j, w = j + lli;
          for (int k = 0; k < (llndim1); k++) {
            NTTBuild[x][arr] =
                (NTTBuild[z][narr] + NTTBuild[w][narr] * rt[y]) % NTTMod;
            x += lli, y += rtp, z += llil, w += llil;
          }
        }
    }
  }
  static void invNTT(unsigned long long *p, int pdeg) {
    int mp = 1 << MAX_DEG;
    unsigned long long u = modPow(1 << pdeg, NTTMod - 2);
    for (int i = (pdeg + 1) - 1; i >= 0; i--) {
      int arr = i & 1, narr = arr ^ 1, lli = 1 << i, llil = lli << 1,
          llpdim1 = 1 << (pdeg - i - 1), rtp = lli << (MAX_DEG - pdeg);
      for (int j = (lli)-1; j >= 0; j--) {
        if (i == pdeg)
          NTTBuild[j][arr] = p[j] * u % NTTMod;
        else {
          int x = j, y = mp, z = j, w = lli + j;
          for (int k = 0; k < (llpdim1); k++) {
            NTTBuild[x][arr] =
                (NTTBuild[z][narr] + NTTBuild[w][narr] * rt[y]) % NTTMod;
            x += lli, y -= rtp, z += llil, w += llil;
          }
          z = j, w = lli + j;
          for (int k = 0; k < (llpdim1); k++) {
            NTTBuild[x][arr] =
                (NTTBuild[z][narr] + NTTBuild[w][narr] * rt[y]) % NTTMod;
            x += lli, y -= rtp, z += llil, w += llil;
          }
        }
      }
    }
  }
  Polynomial operator+(Polynomial b) {
    Polynomial res(max(deg, b.deg));
    for (int i = (min(deg, b.deg) + 1); i < (max(deg, b.deg) + 1); i++)
      res.coefficients[i] = ((i <= deg) ? coefficients[i] : b.coefficients[i]);
    for (int i = 0; i < (min(deg, b.deg) + 1); i++)
      res.coefficients[i] = (coefficients[i] + b.coefficients[i]) % NTTMod;
    return res;
  }
  Polynomial operator*(Polynomial b) {
    int neededDeg = 32 - __builtin_clz(deg + b.deg);
    NTT(neededDeg);
    for (int i = 0; i < ((1 << neededDeg)); i++) tempPVPoly[i] = NTTBuild[i][0];
    b.NTT(neededDeg);
    for (int i = 0; i < ((1 << neededDeg)); i++)
      tempPVPoly[i] = tempPVPoly[i] * NTTBuild[i][0] % NTTMod;
    invNTT(tempPVPoly, neededDeg);
    Polynomial res(deg + b.deg);
    for (int i = 0; i < (res.deg + 1); i++)
      res.coefficients[i] = NTTBuild[i][0];
    return res;
  }
  Polynomial operator+(unsigned long long a) {
    Polynomial p(deg);
    for (int i = 0; i < (deg + 1); i++) p.coefficients[i] = coefficients[i];
    p.coefficients[0] += a;
    p.coefficients[0] %= NTTMod;
    return p;
  }
  Polynomial operator*(unsigned long long mult) {
    Polynomial p(deg);
    for (int i = 0; i < (deg + 1); i++)
      p.coefficients[i] = coefficients[i] * mult % NTTMod;
    return p;
  }
  Polynomial operator-(Polynomial p) { return *this + (p * (NTTMod - 1)); }
  void operator+=(Polynomial b) { *this = *this + b; }
  void operator+=(unsigned long long a) {
    coefficients[0] += a;
    coefficients[0] %= NTTMod;
  }
  void operator-=(Polynomial p) { *this = *this - p; }
  void operator*=(Polynomial b) { *this = *this * b; }
  void operator*=(unsigned long long mult) {
    for (int i = 0; i < (deg + 1); i++)
      coefficients[i] *= mult, coefficients[i] %= NTTMod;
  }
};
int n;
unsigned long long x[30];
unsigned long long modX[30];
vector<pair<Polynomial, pair<pair<unsigned long long, unsigned long long>,
                             pair<unsigned long long, unsigned long long>>>>
    func;
Polynomial indefInt(Polynomial f) {
  Polynomial res(f.deg + 1);
  for (int i = (1); i < (res.deg + 1); i++)
    res.coefficients[i] =
        f.coefficients[i - 1] * modPow(i, NTTMod - 2) % NTTMod;
  return res;
}
Polynomial defInt(Polynomial f, Polynomial lo, Polynomial hi) {
  Polynomial first = indefInt(f);
  return first.apply(hi) - first.apply(lo);
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (int i = 0; i < (n); i++) {
    string s;
    cin >> s;
    int numDecimalPlaces = 0;
    for (int j = (s.size()) - 1; j >= 0; j--)
      if (s[j] == '.') numDecimalPlaces = s.size() - j - 1;
    unsigned long long base = modPow(10, 6 - numDecimalPlaces);
    for (int j = (s.size()) - 1; j >= 0; j--)
      if (s[j] != '.') {
        x[i] += base * (s[j] - '0');
        base *= 10;
      }
  }
  x[0] = min(1000000ULL, x[0]);
  for (int i = (1); i < (n); i++) x[i] = min(x[i], x[i - 1] + 1000000ULL);
  unsigned long long invMillion = modPow(1000000ULL, NTTMod - 2);
  for (int i = 0; i < (n); i++) modX[i] = x[i] * invMillion % NTTMod;
  func.push_back(make_pair(
      Polynomial(), make_pair(make_pair(0, 0), make_pair(x[0], modX[0]))));
  func[0].first.coefficients[0] = 1;
  Polynomial xPoly(1);
  xPoly.coefficients[1] = 1;
  for (int i = 0; i < (n - 1); i++) {
    vector<Polynomial> v2;
    vector<tuple<pair<unsigned long long, unsigned long long>, bool, int>> v;
    for (int j = 0; j < (func.size()); j++) {
      pair<double, unsigned long long> lo = func[j].second.first;
      pair<double, unsigned long long> hi = func[j].second.second;
      Polynomial loPoly;
      Polynomial hiPoly;
      loPoly.coefficients[0] = lo.second;
      hiPoly.coefficients[0] = hi.second;
      pair<double, unsigned long long> xVal = make_pair(x[i + 1], modX[i + 1]);
      pair<double, unsigned long long> loP1 =
          make_pair(lo.first + 1000000ULL, (lo.second + 1) % NTTMod);
      pair<double, unsigned long long> hiP1 =
          make_pair(hi.first + 1000000ULL, (hi.second + 1) % NTTMod);
      if (xVal.first > lo.first) {
        v2.push_back(defInt(func[j].first, loPoly, xPoly));
        v.push_back(make_tuple(lo, 1, v2.size() - 1));
        v.push_back(make_tuple(min(hi, xVal), 0, v2.size() - 1));
      }
      if (hi.first < lo.first + 1000000ULL && xVal.first > hi.first) {
        v2.push_back(defInt(func[j].first, loPoly, hiPoly));
        v.push_back(make_tuple(hi, 1, v2.size() - 1));
        v.push_back(make_tuple(min(loP1, xVal), 0, v2.size() - 1));
      }
      if (lo.first + 1000000ULL < xVal.first) {
        v2.push_back(defInt(func[j].first, xPoly + (NTTMod - 1), hiPoly));
        v.push_back(make_tuple(loP1, 1, v2.size() - 1));
        v.push_back(make_tuple(min(hiP1, xVal), 0, v2.size() - 1));
      }
    }
    func.clear();
    sort(v.begin(), v.end());
    pair<unsigned long long, unsigned long long> last = make_pair(0, 0);
    Polynomial curr;
    for (const tuple<pair<unsigned long long, unsigned long long>, bool, int>
             t : v) {
      if (get<0>(t) > last)
        func.push_back(make_pair(Polynomial(curr), make_pair(last, get<0>(t))));
      if (get<1>(t))
        curr += v2[get<2>(t)];
      else
        curr -= v2[get<2>(t)];
      last = get<0>(t);
    }
  }
  Polynomial res;
  for (int i = 0; i < (func.size()); i++) {
    Polynomial lo, hi;
    lo.coefficients[0] = func[i].second.first.second;
    hi.coefficients[0] = func[i].second.second.second;
    res += defInt(func[i].first, lo, hi);
  }
  cout << res.coefficients[0] << endl;
  return 0;
}