using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
//using System.Text;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
//using System.Numerics;
//using static System.Math;
//using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    void chmax<T>(ref T a, T b) where T : IComparable<T> { a = a.CompareTo(b) < 0 ? b : a; }
    void chmin<T>(ref T a, T b) where T : IComparable<T> { a = a.CompareTo(b) < 0 ? a : b; }

    //https://yukicoder.me/submissions/257099 のコメント修正版
    void solve()
    {
        var A = Convert.ToString(long.Parse(ReadLine()), 2);

        int N = A.Length;

        long ans = 0;
        //yの最上位ビットがi，すなわちxの最上位ビットはiではない.また，xにlessフラグが立っていると考えられる
        for (int i = 0; i < N; i++)
        {
            var dp = new long[N, 2, 2]; //pos,lessy,made1のペア
            dp[i, i == 0 ? 0 : 1, 0] = 1; //最上位ビットが左端でないときはlessフラグが立つ

            for (int j = i + 1; j < N; j++)//pos
            {
                for (int k = 0; k < 2; k++)//lessy
                {
                    int lim = (k == 1 || A[j] == '1') ? 1 : 0;
                    for (int l = 0; l < 2; l++)//make1のペア
                    {
                        //yとxを全部試す
                        for (int dy = 0; dy < lim + 1; dy++)
                        {
                            for (int dx = 0; dx < 2; dx++)
                            {
                                int b = (k == 1 || dy < lim) ? 1 : 0;
                                int c = (l == 1 || (dy == 1 && dx == 1)) ? 1 : 0;
                                dp[j, b, c] += dp[j - 1, k, l];
                                dp[j, b, c] %= mod;
                            }
                        }
                    }
                }
            }

            ans += dp[N - 1, 0, 1] + dp[N - 1, 1, 1];
            ans %= mod;

        }
        WriteLine(ans);
    }

}

class Scanner
{
    string[] s; int i;
    char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan { get { return ReadLine().Split(); } }
    public int[] scanint { get { return Array.ConvertAll(scan, int.Parse); } }
    public long[] scanlong { get { return Array.ConvertAll(scan, long.Parse); } }
    public double[] scandouble { get { return Array.ConvertAll(scan, double.Parse); } }
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint { get { return int.Parse(next); } }
    public long nextlong { get { return long.Parse(next); } }
    public double nextdouble { get { return double.Parse(next); } }
}