#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
// constexpr int mod = 1000000007;
constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

struct mint {
    int x;
    mint() : x(0) {}
    mint(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    mint& operator+=(const mint& p){
        if((x += p.x) >= mod)   x -= mod;
        return *this;
    }
    mint& operator-=(const mint& p){
        if((x -= p.x) < 0)  x += mod;
        return *this;
    }
    mint& operator*=(const mint& p){
        x = (int)(1LL * x * p.x % mod);
        return *this;
    }
    mint& operator/=(const mint& p){
        *this *= p.inverse();
        return *this;
    }
    mint operator-() const { return mint(-x); }
    mint operator+(const mint& p) const { return mint(*this) += p; }
    mint operator-(const mint& p) const { return mint(*this) -= p; }
    mint operator*(const mint& p) const { return mint(*this) *= p; }
    mint operator/(const mint& p) const { return mint(*this) /= p; }
    bool operator==(const mint& p) const { return x == p.x; }
    bool operator!=(const mint& p) const { return x != p.x; }
    mint pow(int64_t n) const {
        mint res = 1, mul = x;
        while(n > 0){
            if(n & 1)   res *= mul;
            mul *= mul;
            n >>= 1;
        }
        return res;
    }
    mint inverse() const { return pow(mod - 2); }
    friend ostream& operator<<(ostream& os, const mint& p){
        return os << p.x;
    }
    friend istream& operator>>(istream& is, mint& p){
        int64_t val;
        is >> val;
        p = mint(val);
        return is;
    }
};

mint dp[200005][2][3][4];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<int> a(n);
    for(int i = 0; i < n; ++i)  cin >> a[i];

    vector<mint> pow2(n + 1, 1);
    for(int i = 0; i < n; ++i)  pow2[i + 1] = pow2[i] * 2;

    dp[0][0][0][0] = 1;
    for(int i = 0; i < n; ++i){
        if(a[i] == 0){
            for(int j = 0; j < 2; ++j){
                for(int k = 0; k < 2; ++k){
                    dp[i + 1][j][k][0] += dp[i][j][k][0];
                    dp[i + 1][j][k][2] += dp[i][j][k][2];
                }
            }
        }
        else{
            for(int j = 0; j < 2; ++j){
                int nj = j ^ (a[i] < 0);
                for(int k = 0; k < 2; ++k){
                    int nk = k + (abs(a[i]) == 2);
                    dp[i + 1][j][k][0] += dp[i][j][k][0];
                    dp[i + 1][nj][nk][1] += dp[i][j][k][0] * pow2[max(0, i - 1)];
                    dp[i + 1][nj][nk][1] += dp[i][j][k][1];
                    dp[i + 1][nj][nk][2] += dp[i][j][k][0] * pow2[max(0, i - 1)] * pow2[max(0, n - i - 2)];
                    dp[i + 1][nj][nk][2] += dp[i][j][k][1] * pow2[max(0, n - i - 2)];
                    dp[i + 1][j][k][2] += dp[i][j][k][2];
                }
            }
        }
    }

    cout << dp[n][1][1][2] / pow2[n - 1] << endl;

    return 0;
}