#include<bits/stdc++.h>
using namespace std;
int a[100005], cnt, n;
const int mod = 1000000007;
long long  f[100005][2];
string s;
int num[100005];
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> s;
	n = s.size();
	for (int i = 1; i <= n; i++) {
		num[i] = s[n - i] - '0';
	}
	while (n) {
		int lst = 0;
		for (int i = n; i >= 1; i--) {
			if ((num[i] + lst * 10) & 1) {
				num[i] = (num[i] + lst * 10) >> 1;
				lst = 1;
			} else {
				num[i] = (num[i] + lst * 10) >> 1;
				lst = 0;
			}
		}
		a[++cnt] = lst;
		if (!num[n]) n--;
	}
	f[1][0] = 1;
	for (int i = 1; i <= cnt; i++) {
//		cout << i << " " << a[i] << ' ' << f[i][0] << " " << f[i][1] << "\n";
		if (a[i]) {
			f[i + 1][1] = (f[i + 1][1] + f[i][1]) % mod;
			f[i + 1][0] = (f[i + 1][0] + f[i][1] + f[i][0]) % mod;
		} else {
			f[i + 1][1] = (f[i + 1][1] + f[i][1] + f[i][0]) % mod;
			f[i + 1][0] = (f[i + 1][0] + f[i][0]) % mod;
		}
	}
	cout << f[cnt + 1][0];
}