#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000000 + 7;
long long power(long long x, long long y) {
  long long res = 1;
  x = x;
  while (y > 0) {
    if (y & 1) res = (res * x);
    y = y >> 1;
    x = (x * x);
  }
  return res;
}
long long powe(long long x, long long y) {
  x = x % mod, y = y % (mod - 1);
  long long ans = 1;
  while (y > 0) {
    if (y & 1) {
      ans = (1ll * x * ans) % mod;
    }
    y >>= 1;
    x = (1ll * x * x) % mod;
  }
  return ans;
}
void fun() {}
bool isPrime(long long n) {
  for (long long i = 2; i * i <= n; i++)
    if (n % i == 0) return false;
  return true;
}
long long ncr(long long n, long long r) {
  long long res = 1;
  if (r > n) return 0;
  if (r > n - r) r = n - r;
  for (long long i = 0; i < r; i++) {
    res *= (n - i);
    res /= (i + 1);
  }
  return res;
}
long long MOD = 998244353;
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  fun();
  long long ttt = 1;
  while (ttt--) {
    long long n;
    cin >> n;
    long long a[n];
    map<long long, long long> m;
    for (long long i = 0; i < n; i++) cin >> a[i], m[a[i]] = i;
    long long pos = m[a[0]];
    long long ans = 1;
    for (long long i = 1; i < n; i++) {
      if (i <= pos) {
        pos = max(m[a[i]], pos);
        continue;
      }
      pos = m[a[i]];
      ans = ((ans % MOD) * 2) % MOD;
    }
    cout << ans << "\n";
  }
  return 0;
}
