#include <iostream>
#include <string>
#include <vector>

using namespace std;
typedef long long ll;
ll mod = 924844033,dp[3000010][2] = {};
vector<ll> v,u;
int main(){
    string s; cin >> s;
    int i,n = s.size();
    v.push_back(-1);
    for(i=0;i<n;i++){
        if(s[i]=='1') v.push_back(i);
    }
    v.push_back(n);
    for(i=0;i<(int)v.size() - 1;i++) u.push_back(v[i + 1] - v[i] - 1);
    ll ans = (u[0] + 1)*(u.back() + 1)%mod;
    dp[1][0] = 1; dp[1][1] = u[1] + 1;
    for(i=2;i<(int)u.size() - 1;i++){
        dp[i][1] = (u[i] + 1)*dp[i - 1][1]%mod;
        dp[i][0] = (dp[i - 1][1] + dp[i - 1][0])%mod;
    }
    /*for(i=0;i<u.size();i++) cout << u[i] << " ";
    cout << endl;*/
    int k = u.size();
    (ans *= (dp[k - 2][0] + dp[k - 2][1])%mod) %= mod;
    cout << ans << endl;
}