#include <bits/stdc++.h>

using namespace std;

constexpr int mod = 998244353;

auto& add(auto&& a, auto b) { return a -= (a += b) >= mod? mod: 0; }
auto& mul(auto&& a, auto b) { return a = a * (uint64_t)b % mod; }

struct DSU {
  int p[36];
  DSU() { fill(p, p + 36, -1); }
  int g(int v) { return p[v] < 0? v: p[v] = g(p[v]); }
  bool u(int u, int v) { return (u = g(u)) != (v = g(v))? p[v] = u, 1: 0; }
};

int dp[1 << 11];

int solve(auto& gr, auto val) {
  int n = val.size();
  fill_n(dp, 1 << n, 0);
  vector<int> mgr(n);
  for (auto [a, b]: gr) mgr[b] |= 1 << a;
  dp[0] = 1;
  for (int v = 10; v--; )
  for (int m = 1 << n; m--; ) if (dp[m]) {
    int ava = 0;
    for (int i = 0; i < n; ++i) if (!(m >> i & 1) && !(mgr[i] & ~m) && (!~val[i] || val[i] == v)) ava |= 1 << i;
    for (int t = 0; --t &= ava; ) add(dp[m + t], dp[m]);
  }
  return dp[(1 << n) - 1];
}

int solve(auto& gr, DSU eq) {
  DSU weak;
  vector<array<int, 2>> compe[36];
  vector<int> compv[36], compval[36];
  for (auto [a, b]: gr) if (min(a, b) > 9) weak.u(a, b); else if (max(a, b) > 9) compv[weak.g(max(a, b))].push_back(min(a, b));
  for (int i = 10; i < 36; ++i) sort(compv[i].begin(), compv[i].end()), compv[i].erase(unique(compv[i].begin(), compv[i].end()), compv[i].end());
  for (int i = 10; i < 36; ++i) if (eq.g(i) == i) compv[weak.g(i)].push_back(i);
  for (int i = 10; i < 36; ++i) for (int j = 0; j < compv[i].size(); ++j) if (compval[i].resize(compv[i].size(), -1), compv[i][j] <= 9) compval[i][j] = compv[i][j];
  auto id = [&](int c, int v) {
    auto& loc = compv[c];
    return find(loc.begin(), loc.end(), v) - loc.begin();
  };
  for (auto [a, b]: gr) if (max(a, b) > 9) { int c = weak.g(max(a, b)); compe[c].push_back({id(c, a), id(c, b)}); }
  int ans = 1;
  for (int i = 10; i < 36; ++i) if (compv[i].size()) {
    mul(ans, solve(compe[i], compval[i]));
  }
  return ans;
}

vector<array<string, 2>> inp;
int ans;

bool isgr(auto& gr, int a, int b) {
  uint64_t vis = 1ull << a;
  for (int ch = 1; ch--; )
  for (auto [x, y]: gr) if ((vis >> x & 1) && !(vis >> y & 1)) ch = 1, vis |= 1ull << y;
  return vis >> b & 1;
}

void solve(auto gr, DSU eq, int i) {
  if (i == inp.size()) return void(add(ans, solve(gr, eq)));
  for (int j = 0; j < inp[i][0].size(); ++j) if (int a = eq.g(inp[i][0][j]), b = eq.g(inp[i][1][j]); a != b) {
    if (isgr(gr, b, a)) return;
    if (isgr(gr, a, b)) return solve(gr, eq, i + 1);
    gr.push_back({a, b}), solve(gr, eq, i + 1), gr.pop_back();
    eq.u(min(a, b), max(a, b));
    for (auto& [a, b]: gr) a = eq.g(a), b = eq.g(b);
  }
}

int main() {
  DSU eq;
  vector<array<int, 2>> gr;
  for (int i = 0; i < 9; ++i) gr.push_back({i + 1, i});
  int n; cin >> n;
  for (int i = 0; i < n; ++i) {
    string s[2], o; cin >> o;
    for (auto c: "=><"s) if (auto i = o.find(c); ~i) s[0] = o.substr(0, i), s[1] = o.substr(i + 1), o = ""s + c;
    for (int i: {0, 1}) {
      if (s[i].size() < s[!i].size()) s[i].insert(s[i].begin(), s[!i].size() - s[i].size(), '0');
      for (auto& c: s[i]) c = c <= '9'? c - '0': c - 'A' + 10;
    }
    if (o == "<") swap(s[0], s[1]);
    if (o == "=") for (int i = 0; i < s->size(); ++i) eq.u(min(s[0][i], s[1][i]), max(s[0][i], s[1][i]));
    else inp.push_back({s[0], s[1]});
  }
  solve(gr, eq, 0);
  cout << ans << '\n';
}