#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/modint>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using mint = atcoder::modint998244353;

ostream& operator<<(ostream& os, const mint& m){
    os << m.val();
    return os;
}

mint dp[4005][4005][2];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    string s; cin >> s;
    int n = s.size();
    if(n%2 == 1){
        cout << 0 << endl;
        return 0;
    }
    dp[0][0][0] = 1;
    for(int i = 0; i < n; i++){
        for(int j = 0; j <= i; j++){
            for(int k = 0; k < 2; k++){
                for(int l = k; l < 2; l++){
                    if(s[i] == '.'){
                        if(l == 0){
                            // 開く
                            dp[i+1][j+1][l] += dp[i][j][k]*2;
                            // 閉じる
                            if(j-1 >= 0) dp[i+1][j-1][l] += dp[i][j][k];
                        }else{
                            if(l != k){
                                if(j-1 >= 0) dp[i+1][j-1][l] += dp[i][j][k];
                                continue;
                            }
                            // 開く
                            dp[i+1][j+1][l] += dp[i][j][k];
                            // 閉じる
                            if(j-1 >= 0) dp[i+1][j-1][l] += dp[i][j][k]*2;
                        }
                    }else{
                        if(k != l) {
                            if(s[i] == '?'){
                                if(j-1 >= 0) dp[i+1][j-1][l] += dp[i][j][k];
                            }
                            continue;
                        }
                        int dj = [&](){
                            if(s[i] == '(') return 1;
                            if(s[i] == ')') return -1;
                            if(l == 0) return 1;
                            return -1;
                        }();
                        if(j+dj >= 0) dp[i+1][j+dj][l] += dp[i][j][k];
                    }
                }
            }
        }
    }
    cout << dp[n][0][0]+dp[n][0][1] << endl;
}