#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;


template<class T, T (*add)(T, T), T (*zero)(), T (*mul)(T, T), T (*one)(), int N>
struct Mat : array<array<T, N>, N> {
  using M = Mat<T, add, zero, mul, one, N>;
  void make_identity() {
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        (*this)[i][j] = zero();
      }
    }
    for (int i = 0; i < N; i++) {
      (*this)[i][i] = one();
    }
  }
  M& operator+=(const M& rhs) {
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        (*this)[i][j] = add((*this)[i][j], rhs[i][j]);
      }
    }
    return *this;
  }
  M& operator*=(const M& rhs) {
    static M temp;
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        temp[i][j] = zero();
      }
    }
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        for (int k = 0; k < N; k++) {
          temp[i][k] = add(temp[i][k], mul((*this)[i][j], rhs[j][k]));
        }
      }
    }
    *this = temp;
    return *this;
  }
  template <class I>
  void inplace_pow(I k) {
    assert(k >= 0);
    static M temp;
    temp = *this;
    make_identity();
    while (k) {
      if (k & 1) *this *= temp;
      k >>= 1;
      if (k) temp *= temp;
    }
  }
  friend ostream& operator<<(ostream& os, const M& A) {
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        os << A[i][j] << " \n"[j + 1 == N];
      }
    }
    return os;
  }
};

// mint
mint add(mint x, mint y) { return x + y; }
mint zero() { return mint(); }
mint mul(mint x, mint y) { return x * y; }
mint one() { return mint::raw(1); }
using M = Mat<mint, add, zero, mul, one, 51>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  string t;
  cin >> t;
  int m = t.size();
  vector<M> d(n);
  rep(z, n) {
    string s;
    cin >> s;
    if (s[0] == '~') {
      int j, k;
      cin >> j >> k;
      j--, k--;
      d[z] = d[j];
      d[z] *= d[k];
    } else {
      M A;
      int sz = s.size();
      auto chk = [&](int p1, int p2) {
        while(p1 < m && p2 < sz) if (t[p1++] != s[p2++]) return false;
        // cout << z << ' ' << p1<< ' ' << p2 << endl;
        return true;
      };
      rep(i, m) {
        if (i >= 1) {
          if (chk(i, 0)) {
            A[i][min(i + sz, m)] = 1;
          }
        } else {
          for(int from = 0; from < sz; from++) {
            if (chk(i, from)) {
              A[i][min(i + sz - from, m)]++;
            }
          }
        }
      }
      A[0][0] = 1;
      A[m][m] = 1;
      d[z] = A;
    }
  }
  mint ans = d[n - 1][0][m];
  cout << ans.val() << '\n';
}