#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 3000000000000000

struct combi{
	deque<mint> kaijou;
	deque<mint> kaijou_;
	
	combi(int n){
		kaijou.push_back(1);
		for(int i=1;i<=n;i++){
			kaijou.push_back(kaijou[i-1]*i);
		}
		
		mint b=kaijou[n].inv();
		
		kaijou_.push_front(b);
		for(int i=1;i<=n;i++){
			int k=n+1-i;
			kaijou_.push_front(kaijou_[0]*k);
		}
	}
	
	mint combination(int n,int r){
		if(r>n)return 0;
		mint a = kaijou[n]*kaijou_[r];
		a *= kaijou_[n-r];
		return a;
	}
	
	mint junretsu(int a,int b){
		mint x = kaijou_[a]*kaijou_[b];
		x *= kaijou[a+b];
		return x;
	}
	
	mint catalan(int n){
		return combination(2*n,n)/(n+1);
	}
	
};


int main(){
	combi C(500000);
	string s;
	cin>>s;
	int n = s.size();
	if(s.size()%2==1){
		cout<<0<<endl;
		return 0;
	}
	
	vector dp(n+1,vector<mint>(2,0));
	dp[0][0] = 1;
	dp[0][1] = 1;
	rep(i,n){
		vector ndp(n+1,vector<mint>(2,0));
		rep(j,n+1){
			rep(k,2){
				if(dp[j][k]==0)continue;
				rep(l,3){
					if(l==0){
						if(s[i]!='('&&s[i]!='.')continue;
						ndp[j+1][k] += dp[j][k];
					}
					if(l==1){
						if(s[i]!=')'&&s[i]!='.')continue;
						if(j==0)continue;
						ndp[j-1][k] += dp[j][k];
					}
					if(l==2){
						if(s[i]!='?'&&s[i]!='.')continue;
						if(k==0){
							ndp[j+1][k] += dp[j][k];
							ndp[j+1][1] += dp[j][k];
						}
						else{
							if(j==0)continue;
							ndp[j-1][k] += dp[j][k];
						}						
					}
					
				}
			}
			
		}
		swap(dp,ndp);
		
	}
	
	cout<<dp[0][1].val()<<endl;
	
	return 0;
}