#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
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;}
//-------------------------------------------------------

const ll mo=998244353;
ll from[2020][2];
ll to[2020][2];
int N;
string S;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>S;
	from[0][0]=1;
	FORR(c,S) {
		ZERO(to);
		if(c=='('||c=='.') {
			FOR(i,2001) {
				to[i+1][0]+=from[i][0];
				to[i+1][1]+=from[i][1];
			}
		}
		if(c==')'||c=='.') {
			FOR(i,2001) {
				to[i][0]+=from[i+1][0];
				to[i][1]+=from[i+1][1];
			}
		}
		if(c=='?'||c=='.') {
			FOR(i,2001) {
				to[i+1][0]+=from[i][0];
				to[i][1]+=(from[i+1][0]+from[i+1][1]);
			}
		}
		FOR(i,2001) FOR(j,2) from[i][j]=to[i][j]%mo;
	}
	cout<<(from[0][0]+from[0][1])%mo<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}