#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;

mint f[1 << 2 * 8], g[1 << 2 * 8];
int take_parity_bits[1 << 2 * 8];
int expand_to_3bits[1 << 2 * 8];
int section_to_2bits[1 << 3 * 8];
VI trans[1 << 8];

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  rep(s, 1 << 2 * 8) {
    int t = 0;
    rep(i, 8) t |= (s >> 2 * i & 1) << i;
    take_parity_bits[s] = t;
  }
  rep(s, 1 << 2 * 8) {
    int t = 0;
    rep(i, 8) t |= (s >> 2 * i & 3) << 3 * i;
    expand_to_3bits[s] = t;
  }
  rep(s, 1 << 3 * 8) {
    int t = 0;
    rep(i, 8) t |= (s >> 3 * i + 1 & 3) << 2 * i;
    section_to_2bits[s] = t;
  }
  rep(s, 1 << 16) {
    int t = 0;
    int add = 0;
    rep(e, 16) if (s >> e & 1) {
      for(int p: {e / 4, e % 4 + 4}) {
        t ^= 1 << p;
        add += 1 << 3 * p;
      }
    }
    trans[t].emplace_back(add);
  }
  int d[8];
  rep(i, 8) cin >> d[i], d[i] -= 4;
  f[0] = 1;
  rep(_, 30) {
    int dbit = 0;
    rep(i, 8) dbit |= (d[i] & 1) << i;
    rep(s, 1 << 2 * 8) g[s] = 0;
    rep(s, 1 << 2 * 8) {
      mint v = f[s];
      int es = expand_to_3bits[s];
      for(int add: trans[take_parity_bits[s] ^ dbit]) {
        g[section_to_2bits[es + add]] += v;
      }
    }
    rep(i, 1 << 2 * 8) f[i] = g[i];
    rep(i, 8) d[i] /= 2;
  }
  cout << f[0].val() << '\n';
}