#include <bits/stdc++.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cout<<v[i][j]<<" ";}cout<<endl;}


typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
//const ll MOD = 1000000007;
const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0, -1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
//#define mp make_pair


int main() {
  string s;
  cin >> s;
  int n = s.size();
  int mb = 0, mr = 0;
  rep (i, n) {
    if (s[i] == '0') mr += 2;
    else if (s[i] == '1') {mr++; mb++;}
    else {mb += 2;}
  }
  vll dp(mr + 1, vl(mb + 1));
  dp[0][0] = 1;
  for (int can = 0; can < n; can++) {
    for (int i = 0; i <= can; i++) {
      int j = can - i;
      if (i > mr || j > mb) continue;
      if (dp[i][j] == 0) continue;
      int b = 0, r = 0;
      if (s[can] == '0') {
        r = 2;
      }
      else if (s[can] == '1') {
        r = b = 1;
      }
      else if (s[can] == '2') {
        b = 2;
      }
      int ni = i + r, nj = j + b;
      if (ni > 0 && ni - 1 <= mr && nj <= mb) {
        (dp[ni - 1][nj] += dp[i][j]) %= MOD;
      }
      if (nj > 0 && ni <= mr && nj - 1 <= mb) {
        (dp[ni][nj - 1] += dp[i][j]) %= MOD;
      }
    }
  }
  for (int can = 0; can < n; can++) {
    for (int i = 0; i <= can; i++) {
      int j = can - i;
      if (i > mr || j > mb) continue;
      dp[i][j] = 0;
    }
  }
  for (int can = n; can > 0; can--) {
    for (int i = 0; i <= can; i++) {
      int j = can - i;
      if (i > mr || j > mb) continue;
      if (dp[i][j] == 0) continue;
      if (i > 0) {
        (dp[i - 1][j] += dp[i][j]) %= MOD;
      }
      if (j > 0) {
        (dp[i][j - 1] += dp[i][j]) %= MOD;
      }
    }
  }
  cout << dp[0][0] << endl;
}


Measured memory_bytes: 31616