func_code_string: #include <bits/stdc++.h>   using namespace std;   const int MAXN = 2e6 + 500;   const long double eps = (1e-12);   const int logn = 21;   const double Pi = acos(-1.0);   const long long pp = 998244353;   int lowbit(int x) { return x & (-x); }   const long long INF = 1e11 + 7;   long long dp[3][205][4];   long long a[MAXN];   long long pre[MAXN];   long long lst[MAXN];   signed main() {     long long n;     scanf( %lld , &n);     for (long long i = 1; i <= n; i++) {       scanf( %lld , &a[i]);     }     dp[0][1][2] = 1;     long long now = 0;     for (long long i = 1; i <= n; i++) {       now ^= 1;       for (long long j = 1; j <= 200; j++) {         pre[j] = lst[j] = 0;         for (long long k = 0; k <= 2; k++) dp[now][j][k] = 0;       }       for (long long k = 0; k <= 2; k++) pre[1] += dp[now ^ 1][1][k];       for (long long j = 2; j <= 200; j++) {         for (long long k = 0; k <= 2; k++) pre[j] += dp[now ^ 1][j][k];         pre[j] %= pp;         pre[j] += pre[j - 1];         pre[j] %= pp;       }       for (long long k = 1; k <= 2; k++) lst[200] += dp[now ^ 1][200][k];       for (long long j = 199; j > 0; j--) {         for (long long k = 1; k <= 2; k++) lst[j] += dp[now ^ 1][j][k];         lst[j] %= pp;         lst[j] += lst[j + 1];         lst[j] %= pp;       }       for (long long j = 1; j <= 200; j++) {         dp[now][j][0] += pre[j - 1];         dp[now][j][0] %= pp;         dp[now][j][1] +=             dp[now ^ 1][j][0] + dp[now ^ 1][j][1] + dp[now ^ 1][j][2];         dp[now][j][1] %= pp;         dp[now][j][2] += lst[j + 1];         dp[now][j][2] %= pp;       }       if (a[i] != -1) {         for (long long j = 1; j <= 200; j++) {           if (j == a[i]) continue;           for (long long k = 0; k <= 2; k++) {             dp[now][j][k] = 0;           }         }       }     }     long long ans = 0;     for (long long j = 1; j <= 200; j++) {       for (long long k = 1; k <= 2; k++) {         ans += dp[now][j][k];         ans %= pp;       }     }     printf( %lld , ans);     return 0;   }   