#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)

#include <atcoder/modint>
using mint = atcoder::modint998244353;

void solve() {
    string s;
    cin >> s;
    reverse(s.begin(), s.end());
    ll n = s.size();
    mint ans = 0, x = 1;
    rep(i, 0, n) {
        ans += mint(2).pow(n-i-1) * (s[i] - '0') * mint(11).pow(i);
    }
    cout << ans.val() << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}