#ifdef LOCAL
#include "stdafx.h"
#else
#include <bits/stdc++.h>
#define IL inline
#define LL long long
#define eb emplace_back
#define sz(v) ((int) (v).size())
#define me(f, x) memset(f, x, sizeof(f))
#define mc(f, g) memcpy(f, g, sizeof(g))
#define L(i, j, k) for (int i = (j); i <= (k); ++i)
#define R(i, j, k) for (int i = (j); i >= (k); --i)
#define FIO(FILE) freopen(FILE".in", "r", stdin), freopen(FILE".out", "w", stdout)
using namespace std;

using vi = vector<int>;
#endif

namespace IO {
  char ibuf[1 << 20], *iS, *iT, obuf[1 << 20], *oS = obuf;
#define wrsp(x) wr(x), pc(' ')
#define wrln(x) wr(x), pc('\n')

// Helps
#ifndef LOCAL
#define gh() (iS == iT ? iT = (iS = ibuf) + fread(ibuf, 1, 1 << 20, stdin), (iS == iT ? EOF : *iS++) : *iS++)
#else
#define gh() getchar()
#endif

  IL void flush () {
    fwrite(obuf, 1, oS - obuf, stdout), oS = obuf;
  }

  struct Flusher {
    ~Flusher () {
      flush();
    }
  } AutoFlush;

  IL void pc (char ch) {
    if (oS == obuf + (1 << 20)) flush(); 
    *oS++ = ch;
  }
//

  IL char gc () {
    char ch = gh();
    while (!isalpha(ch)) {
      ch = gh();
    }
    return ch;
  }

  template<typename T = int>
  IL T rd () {
    char ch = gh();
    T x = 0;
    bool t = 0;
    while (ch < '0' || ch > '9') t |= ch == '-', ch = gh();
    while (ch >= '0' && ch <= '9') x = (x << 1) + (x << 3) + (ch ^ 48), ch = gh();
    return t ? ~(x - 1) : x;
  }

  char buf[64], *tp = buf;
  template<class T>
  IL void wr (T x) {
    if (x < 0) {
      x = ~(x - 1);
      pc('-');
    }
    do {
      *tp++ = x % 10;
      x /= 10;
    } while (x);
    while (tp != buf) {
      pc((*--tp) | 48);
    }
  }
}

using IO::rd;
using IO::wr;
using IO::gc;
using IO::pc;

constexpr int N = 2500;
constexpr int P = 998244353;
int n, a[N], to[N];
LL w[N];
bool inq[N], vis[N][N];
vi g[N];

int get (int x) {
  int y = to[x] * 2;
  return a[x] == a[y - 1] ? y - 1 : y;
}

int main () {
  n = rd();
  L (i, 1, n) {
    char o = gc();
    if (o == 'P') {
      a[i * 2 - 1] = rd();
      to[i * 2 - 1] = rd();
      a[i * 2] = rd();
      to[i * 2] = rd();
    } else {
      a[i * 2 - 1] = -1;
      to[i * 2 - 1] = -1;
      a[i * 2] = rd();
      to[i * 2] = rd();
    }
  }
  a[0] = -1;
  to[0] = 1;
  L (i, 0, 2 * n) {
    w[i] = 1;
  }
  queue<int> Q;
  for (int x = 0; x <= 2 * n; x += 2) {
    int y = get(x);
    if (y % 2) {
      Q.push(x);
      inq[x] = true;
    } else {
      vis[x][y] = true;
      g[y].eb(x);
    }
  }
  while (!Q.empty()) {
    int x = Q.front();
    Q.pop();
    inq[x] = false;
    if (x == 0) {
      cout << w[x] << '\n';
      return 0;
    }
    int y = get(x);
    vi vc = g[x];
    for (int p : vc) {
      (w[p] += w[x] + w[y]) %= P;
      to[p] = to[y];
      int q = get(p);
      if (q % 2) {
        inq[p] = true;
        Q.push(p);
      } else if (!vis[p][q]) {
        vis[p][q] = true;
        if (get(q) % 2) {
          if (!inq[q]) {
            inq[q] = true;
            Q.push(q);
          }
        }
        g[q].eb(p);
      }
    }
    g[x].clear();
  }
  cout << "-1\n";
}
// I love WHQ!