#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


int N;
vector<int> A, B, X, Y;

int f[1030][1030];
Mint g[1030][1030];
int vis[1030][1030];

bool dfs(int z, int c) {
  if (vis[z][c] == 1) return false;
  if (vis[z][c] == 2) return true;
// cerr<<"[dfs] "<<z<<" "<<c<<endl;
  vis[z][c] = 1;
  
  bool ret = true;
  if (c == A[z]) {
    f[z][c] = X[z];
    g[z][c] = 1;
  } else {
    const int y = Y[z];
    const int b = B[z];
    if (dfs(y, b) && dfs(f[y][b], c)) {
      f[z][c] = f[ f[y][b] ][c];
      g[z][c] = 1 + g[y][b] + g[ f[y][b] ][c];
    } else {
      ret = false;
    }
  }
  
  vis[z][c] = 2;
  return ret;
}

int main() {
  char buf[110];
  
  for (; ~scanf("%d", &N); ) {
    ++N;
    A.assign(N, 0);
    B.assign(N, 0);
    X.assign(N, 0);
    Y.assign(N, 0);
    for (int z = 1; z < N; ++z) {
      scanf("%s", buf);
      if (string(buf) == "POP") {
        scanf(" %d GOTO %d; PUSH %d GOTO %d", &A[z], &X[z], &B[z], &Y[z]);
      } else if (string(buf) == "HALT;") {
        scanf(" PUSH %d GOTO %d", &B[z], &Y[z]);
      } else {
        assert(false);
      }
// cerr<<z<<": "<<A[z]<<" "<<X[z]<<" "<<B[z]<<" "<<Y[z]<<endl;
    }
    
    memset(f, ~0, sizeof(f));
    memset(g, 0, sizeof(g));
    memset(vis, 0, sizeof(vis));
    dfs(1, 0);
    
    if (f[1][0] >= 0) {
      printf("%u\n", g[1][0].x);
    } else {
      puts("-1");
    }
  }
  return 0;
}