#include <bits/stdc++.h>
#define ll long long
#define N 200001
#define mod 998244353
#define all(a) a.begin(),a.end()
#define uniqueu(a) a.erase(unique(all(a)), a.end())
using namespace std;
mt19937_64 mrand(random_device{}());

int n;
string s, str;
ll ans;

inline void dfs(int p) {
    if (p == n) {
        for (int i = 0; i < n; i++)
            for (int j = i + 1; j < n; j++)
                for (int k = j + 1; k < n; k++)
                    if (str[i] == '0' && str[j] == '1' && str[k] == '0')
                        ans++;
        return;
    }
    if (s[p] != '?') {
        str[p] = s[p];
        dfs(p + 1);
    } else {
        str[p] = '0';
        dfs(p + 1);
        str[p] = '1';
        dfs(p + 1);
    }
}

inline void solve(void) {
    cin >> s;
    n = (int)(s.size());
    int tot = 0;
    for (auto &i : s)
        if (i != '?')
            tot++;
    if (tot == n) {
        for (int i = 0; i < n; i++)
            for (int j = i + 1; j < n; j++)
                for (int k = j + 1; k < n; k++)
                    if (s[i] == '0' && s[j] == '1' && s[k] == '0')
                        ans++;
        cout << ans % mod << "\n";
        return;
    }
    dfs(0);
    cout << ans % mod << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int Test = 1;
    //cin >> Test;
    for ( ; Test--; ) {
        solve();
    }
}