#include using namespace std; using ll = long long; using ld = long double; // -------------------------------------------------------- template bool chmax(T& a, const T b) { if (a < b) { a = b; return 1; } return 0; } template bool chmin(T& a, const T b) { if (b < a) { a = b; return 1; } return 0; } #define FOR(i,l,r) for (ll i = (l); i < (r); ++i) #define RFOR(i,l,r) for (ll i = (r)-1; (l) <= i; --i) #define REP(i,n) FOR(i,0,n) #define RREP(i,n) RFOR(i,0,n) #define ALL(c) (c).begin(), (c).end() #define RALL(c) (c).rbegin(), (c).rend() #define SORT(c) sort(ALL(c)) #define RSORT(c) sort(RALL(c)) #define MIN(c) *min_element(ALL(c)) #define MAX(c) *max_element(ALL(c)) #define SUMLL(c) accumulate(ALL(c), 0LL) #define COUNT(c,v) count(ALL(c),(v)) #define SZ(c) ((ll)(c).size()) #define BIT(b,i) (((b)>>(i)) & 1) #define PCNT(b) __builtin_popcountll(b) #define CIN(c) cin >> (c) #define COUT(c) cout << (c) << '\n' #define debug(x) cerr << "l." << __LINE__ << " : " << #x << " = " << (x) << '\n' ll llceil(ll a, ll b) { return (a + b - 1) / b; } ll bitlen(ll b) { if (b <= 0) { return 0; } return (64LL - __builtin_clzll(b)); } string toupper(const string& S) { string T(S); REP(i,SZ(T)) T[i] = toupper(T[i]); return T; } string tolower(const string& S) { string T(S); REP(i,SZ(T)) T[i] = tolower(T[i]); return T; } template void cout_line(const vector& ans, ll l, ll r) { for (ll i = l; i < r; i++) { if (i != l) { cout << " "; } cout << ans[i]; } cout << '\n'; } template void debug_line(const vector& ans, ll l, ll r, ll L = 0) { cerr << "l." << L << " :"; for (ll i = l; i < r; i++) { cerr << " " << ans[i]; } cerr << '\n'; } using P = pair; using VP = vector

; using VVP = vector; using VS = vector; using VVS = vector; using VLL = vector; using VVLL = vector; using VVVLL = vector; using VB = vector; using VVB = vector; using VVVB = vector; using VD = vector; using VVD = vector; using VVVD = vector; using VLD = vector; using VVLD = vector; using VVVLD = vector; static const double EPS = 1e-10; static const double PI = acos(-1.0); // static const ll MOD = 1000000007; static const ll MOD = 998244353; static const ll INF = (1LL << 62) - 1; // 4611686018427387904 - 1 // -------------------------------------------------------- // #include // using namespace atcoder; struct mint { ll x; constexpr mint(ll x = 0) noexcept : x((x % MOD + MOD) % MOD) {} constexpr mint& operator+=(const mint& a) noexcept { if ((x += a.x) >= MOD) x -= MOD; return *this; } constexpr mint& operator-=(const mint& a) noexcept { if ((x += MOD - a.x) >= MOD) x -= MOD; return *this; } constexpr mint& operator*=(const mint& a) noexcept { (x *= a.x) %= MOD; return *this; } constexpr mint& operator/=(const mint& a) noexcept { return *this *= a.inv(); } constexpr mint operator-() const noexcept { return mint(-x); } constexpr mint operator+(const mint& a) const noexcept { return mint(*this) += a; } constexpr mint operator-(const mint& a) const noexcept { return mint(*this) -= a; } constexpr mint operator*(const mint& a) const noexcept { return mint(*this) *= a; } constexpr mint operator/(const mint& a) const noexcept { return mint(*this) /= a; } constexpr bool operator==(const mint& a) const noexcept { return x == a.x; } constexpr bool operator!=(const mint& a) const noexcept { return x != a.x; } constexpr mint pow(ll n) const { if (n == 0) return 1; mint res = pow(n >> 1); res *= res; if (n & 1) res *= *this; return res; } constexpr mint inv() const { return pow(MOD - 2); } friend istream& operator>>(istream& is, mint& a) noexcept { ll v; is >> v; a = mint(v); return is; } friend ostream& operator<<(ostream& os, const mint& a) noexcept { return os << a.x; } }; using VM = vector; using VVM = vector; using VVVM = vector; using VVVVM = vector; struct combination { vector fact_, ifact_, inv_; int n_; combination() {} combination(int n) : fact_(n+1,0), ifact_(n+1,0), inv_(n+1,0) { assert(n != 0); assert(n < MOD); n_ = n; fact_[0] = 1; fact_[1] = 1; ifact_[0] = 1; ifact_[1] = 1; inv_[1] = 1; for(int i = 2; i <= n; ++i) { fact_[i] = fact_[i-1] * i; inv_[i] = -inv_[MOD%i] * (MOD/i); ifact_[i] = ifact_[i-1] * inv_[i]; } } mint P(const int& n, const int& k) const noexcept { if (n < 0 || k < 0 || n < k) return 0; return fact_[n] * ifact_[n-k]; } mint C(const int& n, const int& k) const noexcept { if (n < 0 || k < 0 || n < k) return 0; return fact_[n] * ifact_[n-k] * ifact_[k]; } mint H(const int& n, const int& k) const noexcept { if (n < 0 || k < 0) return 0; assert(n + k - 1 <= n_); return C(n + k - 1, k); } mint fact(const int& n) const noexcept { assert(n <= n_); if (n < 0) return 0; return fact_[n]; } mint ifact(const int& n) const noexcept { assert(n <= n_); if (n < 0) return 0; return ifact_[n]; } mint inv(const int& n) const noexcept { assert(n <= n_); if (n < 0) return 0; return inv_[n]; } }; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(15); string S; cin >> S; ll N = SZ(S); VM pow2(N+1,1), pow11(N+1,1); FOR(i,1,N+1) { pow2[i] = pow2[i-1] * 2; pow11[i] = pow11[i-1] * 11; } mint ans = 0; REP(i,N) { ans += pow2[i] * pow11[N-1-i] * (S[i] - '0'); } COUT(ans); return 0; }