#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <cassert>
#include <algorithm>
#include <cmath>
#include <random>
#include <ctime>
#include <cstdlib>
#include <chrono>

using namespace std;
using ll = long long;

const int mod = 998244353;

int lgput(int x, ll p) {
  if (p == 0) {
    return 1;
  }
  if (p % 2 == 0) {
    int aux = lgput(x, p/2);
    return 1LL * aux * aux % mod;
  }
  if (p % 2 == 1) {
    int aux = lgput(x, p - 1);
    return 1LL * aux * x % mod;
  }
}

void solve() {
  int n, last = 0;
  cin >> n;
  ll cnt = 1LL * n * (n - 1) / 2;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    if (last > x) {
      cnt--;
    }
    last = x;
  }
  
  cout << lgput(2, cnt) << '\n';
}

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

  int t = 1;
  //cin >> t;
  while (t--)
    solve();

  return 0;
}