#include<bits/stdc++.h>

using namespace std;

const int N = 4010, P = 1e9+7;

struct modint{
    int _v = 0;

    modint(long long x = 0){
        _v = x % P;
        if(_v < 0) _v += P;
    }

    modint operator+ (const modint &oy) const{
        return modint(_v + oy._v);
    }
    modint operator- (const modint &oy) const{
        return modint(_v - oy._v);
    }
    modint operator* (const modint &oy) const{
        return modint((long long)_v * oy._v);
    }

    modint &operator+= (const modint &oy){
        _v += oy._v;
        if(_v >= P) _v -= P;
        return *this;
    }
    modint &operator-= (const modint &oy){
        _v -= oy._v;
        if(_v < 0) _v += P;
        return *this;
    }
    modint &operator*= (const modint &oy){
        _v = ((long long)_v * oy._v) % P;
        return *this;
    }

    operator int() const{
        return _v;
    }
};

int n;
char a[N];
int b[N];
int c[N], m;

void chu(){
    int t = 0;
    for(int i = n; i; i--){
        b[i] += t*10;
        t = b[i]%2;
        b[i] /= 2;
    }
    while(n && b[n] == 0){
        n--;
    }
}

modint f[N][2];

int main(){

    scanf("%s", a+1);
    n = strlen(a+1);
    for(int i = 1; i <= n; i++){
        b[i] = a[n+1-i]-'0';
    }

    while(n){
        c[++m] = b[1]%2;
        chu();
    }

    // for(int i = m; i; i--){
    //     printf("%d", c[i]);
    // }
    // puts("");

    f[m+1][0] = 1;
    for(int i = m; i; i--){
        if(c[i] == 1){
            f[i][0] += f[i+1][0];
            f[i][1] += f[i+1][0];
            f[i][1] += f[i+1][1];
        }else{
            f[i][0] += f[i+1][0];
            f[i][0] += f[i+1][1];
            f[i][1] += f[i+1][1];
        }
    }

    printf("%d\n", f[1][0]);

    return 0;
}