#include <bits/stdc++.h>
using namespace std;
const int OO = 0x3f3f3f3f, N = 1e4 + 5, mod = 1e9 + 7;
string str;
int fast_power(int b, int p) {
  int res = 1;
  while (p) {
    if (p % 2) res = (1ll * res * b) % mod;
    b = (1ll * b * b) % mod;
    p /= 2;
  }
  return res;
}
int solve(int idx, int sz) {
  if (idx == str.size()) return 0;
  return ((2ll * solve(idx + 1, sz - 1)) % mod +
          ((str[idx] == '1') ? fast_power(2, 2 * sz) : 0)) %
         mod;
}
int main() {
  cin >> str;
  cout << solve(0, str.size() - 1);
  return 0;
}
