#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (int i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"YES\n"; else cout<<"NO\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
template<class T> T min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}



void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	string S;
	cin>>S;
	int N=S.size();
	if(N&1){
		cout<<"0\n";
		return;
	}
	int A=0;
	for(auto c:S){
		if(c=='(') A++;
	}
	if(A>N/2){
		cout<<"0\n";
		return;
	}
	vector<ll> dp1(1+N/2),dp2(1+N/2);
	dp1[0]=1;
	dp2[0]=1;
	rep(i,N){
		vector<ll> n_dp1(1+N/2),n_dp2(1+N/2);
		if(S[i]=='('){
			A--;
			rep(j,N/2){
				n_dp1[j+1]=dp1[j];
				n_dp2[j+1]=dp2[j];
			}
		}
		if(S[i]==')'){
			n_dp1=dp1;
			n_dp2=dp2;
		}
		if(S[i]=='?'){
			rep(j,N/2+1){
				if(j!=N/2){
					n_dp2[j+1]+=dp1[j];
					n_dp1[j+1]+=dp1[j];
				}
				n_dp2[j]+=dp2[j];
			}
		}
		if(S[i]=='.'){
			rep(j,N/2+1){
				if(j!=N/2){
					n_dp2[j+1]+=dp1[j];
					n_dp1[j+1]+=dp1[j];
					n_dp1[j+1]+=dp1[j];
					n_dp2[j+1]+=dp2[j];
				}
				n_dp2[j]+=dp2[j];
				n_dp1[j]+=dp1[j];
				n_dp2[j]+=dp2[j];
			}
		}
		swap(n_dp1,dp1);
		swap(n_dp2,dp2);
		rep(j,N/2+1){
			dp1[j]%=mod;
			dp2[j]%=mod;
			//if(j+A>N/2) dp1[j]=0,dp2[j]=0;
			if(j<(i+2)/2) dp1[j]=0,dp2[j]=0;
		}
		/*vec_out(dp2);
		vec_out(dp1);
		cout<<"\n";*/
	}
	cout<<dp2[N/2]<<"\n";
}