#include <stdio.h>

long long power_mod (long long a, long long b, long long mod_num) {
  long long ans = 1LL;
  
  if (b > 0LL) {
    ans = power_mod(a, b/2LL, mod_num);
    ans = (ans * ans) % mod_num;
    if (b%2LL > 0LL) {
      ans = (ans * (a % mod_num)) % mod_num;
    }
  }
  
  return ans;
}

int main () {
  int n = 0;
  int a[201] = {};
  
  int res = 0;
  
  long long ans = 1LL;
  long long mod_num = 998244353LL;
  
  int sum = 0;
  long long div = 1LL;
  
  res = scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    res = scanf("%d", a+(i+1));
  }
  
  for (int i = 0; i < n; i++) {
    if (a[i] < a[i+1]) {
      sum += a[i+1]-a[i];
    }
  }
  
  if (sum > 100000) {
    printf("0\n");
    return 0;
  }
  
  for (int i = 0; i < n; i++) {
    ans *= (long long)(100000-sum+n-i);
    ans %= mod_num;
    div *= (long long)(i+1);
    div %= mod_num;
  }
  
  printf("%lld\n", (ans*power_mod(div, mod_num-2LL, mod_num))%mod_num);  
  return 0;
}