#include <bits/stdc++.h>
using namespace std;

using LL = long long;

constexpr int P = 998244353;
struct Mint {
  int v;
  Mint(int x = 0) : v(x) {v += v >> 31 & P;}
  int val() const {return v;}
  Mint operator-() const {return -v;}
  Mint &operator+=(const Mint &b) {
    v += b.v - P, v += v >> 31 & P;
    return *this;
  }
  Mint &operator-=(const Mint &b) {
    v -= b.v, v += v >> 31 & P;
    return *this;
  }
  Mint &operator*=(const Mint &b) {
    v = LL(v) * b.v % P;
    return *this;
  }
  Mint &operator/=(const Mint &b) {
    return *this *= b.inv();
  }
  friend Mint operator+(Mint a, const Mint &b) {return a += b;}
  friend Mint operator-(Mint a, const Mint &b) {return a -= b;}
  friend Mint operator*(Mint a, const Mint &b) {return a *= b;}
  friend Mint operator/(Mint a, const Mint &b) {return a /= b;}
  Mint inv() const {return this->pow(P - 2);}
  Mint pow(LL b) const {
    Mint a = *this, c = 1;
    while (b) {
      if (b & 1) c *= a;
      a *= a;
      b /= 2;
    }
    return c;
  }
  friend ostream &operator<<(ostream &os, const Mint &a) {
    return os << a.v;
  }
};

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n;
  cin >> n;
  vector<int> to(n, -1), a(n, -1), b(n), x(n), y(n);
  vector<Mint> f(n);
  for (int i = 0; i < n; i++) {
    string s;
    if (i == 0) getline(cin, s);
    getline(cin, s);
    if (s[0] == 'H') {
      sscanf(s.c_str(), "HALT; PUSH %d GOTO %d", &b[i], &y[i]);
      b[i]--, y[i]--;
    } else {
      sscanf(s.c_str(), "POP %d GOTO %d; PUSH %d GOTO %d", &a[i], &x[i], &b[i], &y[i]);
      a[i]--, x[i]--, b[i]--, y[i]--;
    }
  }
  vector<int> cir(n);
  while (1) {
    bool has = false;
    for (int i = 0; i < n; i++) if (to[i] == -1 && !cir[i]) {
      int u = i;
      Mint s = 1;
      int cnt = 0;
      while (b[i] != a[y[u]] && to[y[u]] != -1 && cnt <= n) {
        s += f[y[u]];
        y[u] = to[y[u]];
        cnt++;
      }
      if (cnt > n) {
        has = 1;
        cir[i] = 1;
        continue;
      }
      if (b[i] == a[y[u]]) {
        has = 1;
        to[i] = x[y[u]];
        f[i] = s + 1;
      }
    }
    if (!has) break;
  }
  int u = 0;
  Mint ans = 1;
  for (int i = 0; i <= n && !cir[u] && a[u] != -1 && to[u] != -1; i++) {
    ans += f[u];
    u = to[u];
  }
  if (a[u] == -1) {
    cout << ans << "\n";
  } else {
    cout << -1 << "\n";
  }
  return 0;
}