Ivan unexpectedly saw a present from one of his previous birthdays. It is array of n numbers from 1 to 200. Array is old and some numbers are hard to read. Ivan remembers that for all elements at least one of its neighbours ls not less than it, more formally:

a_{1} ≤ a_{2},

a_{n} ≤ a_{n-1} and

a_{i} ≤ max(a_{i-1},    a_{i+1}) for all i from 2 to n-1.

Ivan does not remember the array and asks to find the number of ways to restore it. Restored elements also should be integers from 1 to 200. Since the number of ways can be big, print it modulo 998244353.

Input

First line of input contains one integer n (2 ≤ n ≤ 10^{5}) — size of the array.

Second line of input contains n integers a_{i} — elements of array. Either a_{i} = -1 or 1 ≤ a_{i} ≤ 200. a_{i} = -1 means that i-th element can't be read.

Output

Print number of ways to restore the array modulo 998244353.

Examples

Input

3
1 -1 2


Output

1


Input

2
-1 -1


Output

200

Note

In the first example, only possible value of a_{2} is 2.

In the second example, a_{1} = a_{2} so there are 200 different values because all restored elements should be integers between 1 and 200. 
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int mod = 998244353;
int n, A[N], dp[N][210][2], Sum[210][2];
int main() {
  ios::sync_with_stdio(false);
  while (cin >> n) {
    for (int i = 1; i <= n; i++) {
      cin >> A[i];
    }
    for (int i = 1; i <= 200; i++) {
      if (A[1] == -1 || A[1] == i) {
        dp[1][i][0] = 1;
      } else {
        dp[1][i][0] = 0;
      }
      dp[1][i][1] = 0;
    }
    Sum[0][0] = Sum[0][1] = 0;
    for (int i = 1; i <= 200; i++) {
      Sum[i][0] = Sum[i - 1][0] + dp[1][i][0];
      Sum[i][1] = Sum[i - 1][1] + dp[1][i][1];
    }
    for (int i = 2; i <= n; i++) {
      for (int j = 1; j <= 200; j++) {
        if (A[i] == -1 || A[i] == j) {
          dp[i][j][1] =
              (Sum[200][1] - Sum[j][1] + dp[i - 1][j][1] + dp[i - 1][j][0]) %
              mod;
          dp[i][j][0] = (Sum[j - 1][1] + Sum[j - 1][0]) % mod;
        }
      }
      Sum[0][0] = Sum[0][1] = 0;
      for (int j = 1; j <= 200; j++) {
        Sum[j][0] = (Sum[j - 1][0] + dp[i][j][0]) % mod;
        Sum[j][1] = (Sum[j - 1][1] + dp[i][j][1]) % mod;
      }
    }
    cout << Sum[200][1] << endl;
  }
  return 0;
}
