import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum MO = 998244353L;

int N;
string S;

void main() {
  try {
    for (; ; ) {
      S = readToken();
      N = cast(int)(S.length);
      
      auto sumA = new int[N + 1];
      auto sumB = new int[N + 1];
      foreach (i; 0 .. N) {
        sumA[i + 1] = sumA[i] + (2 - (S[i] - '0'));
        sumB[i + 1] = sumB[i] + (S[i] - '0');
      }
      
      auto dp = new long[][](2 * N + 1, 2 * N + 1);
      dp[0][0] = 1;
      foreach (a; 0 .. 2 * N + 1) foreach (b; 0 .. 2 * N + 1) {
        if (a + b > 0) {
          if (a <= sumA[min(a + b, N)] && b <= sumB[min(a + b, N)]) {
            if (a > 0) {
              dp[a][b] += dp[a - 1][b];
            }
            if (b > 0) {
              dp[a][b] += dp[a][b - 1];
            }
            dp[a][b] %= MO;
          }
        }
      }
      long ans;
      foreach (a; 0 .. 2 * N + 1) foreach (b; 0 .. 2 * N + 1) {
        if (a + b == 2 * N) {
          ans += dp[a][b];
          ans %= MO;
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}