#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
string s[15];
int cnt[15], tmp;
ll ksm(ll x, ll y)
{
	ll ans = 1;
	while (y)
	{
		if (y & 1) ans = ans * x % mod;
		x = x * x % mod;
		y >>= 1;
	}
	return ans;
}
string jian(string x)
{
	int u = x.size() - 1;
	while (x[u] != '1')
	{
		x[u] = '1';
		tmp++;
		u--;
	}
	tmp--;
	x[u]--;
	return x;
}
void dfs(int x)
{
	if (x == 11) return;
	s[x] = s[x - 1] + jian(s[x - 1]);
	for (int i = 0;  i < s[x].size(); ++i) 
	{
		if (s[x][i] == '1') cnt[x]++;
	}
	dfs(x + 1);
}
int main()
{
	s[0] = "1";
	dfs(1);
	int n;
	cin >> n;
	if (n <= 10) cout << cnt[n] << endl;
	else
	{
		int ans = cnt[10], Temp = n - 10, lst = cnt[10];
		tmp = cnt[10];
		string temp = s[10];
		ans %= mod;
		while (Temp--)
		{
			ans *= 2;
			ans -= lst;
			temp = jian(temp);
			//cout << ans << endl;
			//cout << tmp << endl;
			ans += tmp;
			ans %= mod;
			//cout << ans << endl;
			lst = tmp;
		}
		cout << ans << endl;
	}
    return 0;
}