#include <algorithm>
#include <iostream>
#include <numeric>

using namespace std;

constexpr int N = 502, mod = 998244353;

int a[N], dp[N][N];

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n; cin >> n;
  for (int i = ++n; --i; ) cin >> a[i];
  sort(a, a + n);
  n = unique(a, a + n) - a;
  for (int i = 0; i < n; ++dp[i++][N - 1])
  for (int md = a[i] / 2, j = 0; md++ < a[i]; ) {
    while (a[j] < md) ++j;
    for (int mm = a[i] - md + 1; mm < md; ++mm) dp[i][mm] += dp[j - 1][mm], dp[i][mm] -= dp[i][mm] >= mod? mod: 0;
    for (int mm = max(a[i] - md + 1, md); mm < N; ++mm) dp[i][md] += dp[j - 1][md], dp[i][md] -= dp[i][md] >= mod? mod: 0;
  }
  cout << accumulate(dp[n - 1], dp[n], 0ull) % mod;
}