#include<bits/stdc++.h>
#include<atcoder/modint>
using namespace atcoder;
using mint=modint998244353;
using namespace std;
#define rep(i,N) for(i=0;i<N;i++)
#define ll long long

int main(void){
    ll N;
    ll C[100009];
    bool zero=0;

    ll i,j,k;

    cin>>N;
    rep(i,N){
        cin>>C[i];
        if(C[i]==0)zero=1;
    }

    sort(C,C+N);

    ll M=0;
    if(C[0]<0)M+=abs(C[0]);
    if(C[N-1]>0)M+=C[N-1];

    mint ans=2;
    ll two=N-2-zero;
    ans=ans.pow(two);
    if(C[0]*C[N-1]<0)ans*=2;
    if(zero)ans*=3;

    cout<<ans.val()<<endl;

    return 0;
}