#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#include <array>
#include <memory>
#include <random>
#ifdef DEBUG
#include "./Lib/debug.hpp"
#include "./Lib/Timer.hpp"
#include "./Lib/sample.hpp"
#else
#define dump(...)
#endif

/* (=＾o＾=) */
#define int ll

/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)(e-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
template<class T>
inline auto sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T>
inline auto unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }
template<class T, class S>
inline auto chmax(T& t, const S& s) { if (s > t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmaxE(T& t, const S& s) { if (s >= t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmin(T& t, const S& s) { if (s < t) { t = s; return true; } return false; }
inline auto BR() { std::cout << "\n"; }

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;
template<class T>
using V = std::vector<T>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;
using std::tuple;

/* constant value */
//constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;

/* Initial processing  */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;

/* Remove the source of the bug */
inline signed pow(signed, signed) { assert(false); return -1; }

/* define hash */
namespace std {
template <>	class hash<std::pair<ll, ll>> { public:	size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } };
}

/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; }

//=============================================================================================

auto solve(const string& s) {

	ll n = s.size();

	VL sum1; sum1.reserve(2 * n);
	{
		VL v(2 * n);
		REP(i, n) {
			v[i] = s[i] - '0';
		}
		REP(i, 2 * n - 1)if (v[i] > 1) {
			v[i + 1] += v[i] - 1;
			v[i] = 1;
		}
		sum1.emplace_back(v[0]);
		FOR(i, 1, 2 * n) { sum1.emplace_back(sum1.back() + v[i]); }
	}

	VL sum0; sum0.reserve(2 * n);
	{
		VL v(2 * n);
		REP(i, n) {
			v[i] = 2 - (s[i] - '0');
		}
		REP(i, 2 * n - 1)if (v[i] > 1) {
			v[i + 1] += v[i] - 1;
			v[i] = 1;
		}
		sum0.emplace_back(v[0]);
		FOR(i, 1, 2 * n) { sum0.emplace_back(sum0.back() + v[i]); }
	}


	VVL dp(2 * n, VL(2 * n + 1));
	dp[0][1] = (sum1[0] == 1);
	dp[0][0] = (sum0[0] == 1);
	FOR(i, 1, 2 * n) FOR(j, 0, 2 * n + 1) {
		if (j > sum1[i]) { continue; }
		if (i - j >= sum0[i]) { continue; }
		dp[i][j] = dp[i - 1][j] + ((j - 1 >= 0) ? dp[i - 1][j - 1] : 0);
		dp[i][j] %= MOD;
	}
	ll ans = 0;
	REPC(x, dp[2 * n - 1]) { chmax(ans, x); }
	dump(dp);
	return ans;
}


signed main() {
	string s;
	cin >> s;

	auto ans = solve(s);
	cout << ans << endl;
}


Measured memory_bytes: 125568