import java.util.Scanner;

public class Main {
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] c = new int[n];
		for (int i = 0; i < n; i++) {
			c[i] = sc.nextInt();
		}
		sc.close();

		int m = 0;
		int z = 0;
		int p = 0;
		for (int i = 0; i < n; i++) {
			if (c[i] < 0) {
				m++;
			} else if (c[i] == 0) {
				z++;
			} else {
				p++;
			}
		}

		int mod = 998244353;
		int b = 1;
		if (m > 0) b++;
		if (p > 0) b++;

		long v1 = power(2, Math.max(m - 1, 0), mod);
		long v2 = power(b, z, mod);
		long v3 = power(2, Math.max(p - 1, 0), mod);
		long ans = 2 * v1 * v2 % mod * v3 % mod;
		System.out.println(ans);
	}

	static long power(long x, long n, int m) {
		if (n == 0) {
			return 1;
		}
		long val = power(x, n / 2, m);
		val = val * val % m;
		if (n % 2 == 1) {
			x %= m;
			val = val * x % m;
		}
		return val;
	}
}