#include <bits/stdc++.h>
using namespace std;
const long long MOD = 924844033;
int main(){
  string S;
  cin >> S;
  int N = S.size();
  vector<int> p;
  for (int i = 0; i < N; i++){
    if (S[i] == '1'){
      p.push_back(i);
    }
  }
  vector<long long> dp0(N + 1, 0);
  vector<long long> dp1(N + 1, 0);
  dp0[0] = 1;
  for (int i = 0; i < N; i++){
    long long s = (dp0[i] + dp1[i]) % MOD;
    if (S[i] == '0'){
      dp0[i + 1] += s;
      dp0[i + 1] %= MOD;
      auto itr = lower_bound(p.begin(), p.end(), i);
      if (itr != p.end()){
        dp1[*itr + 1] += s;
        dp1[*itr + 1] %= MOD;
      }
    }
    if (S[i] == '1'){
      dp1[i + 1] += s;
      dp1[i + 1] %= MOD;
    }
  }
  long long ans = 0;
  for (int i = 1; i <= N; i++){
    ans += dp1[i];
  }
  for (int i = N - 1; i >= 0; i--){
    if (S[i] == '1'){
      break;
    }
    ans += dp0[i + 1];
  }
  ans %= MOD;
  cout << ans << endl;
}