using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using SB = System.Text.StringBuilder;
//using System.Threading.Tasks;
//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();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    readonly int dom = 998244353;
    bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }

    void solve()
    {
        var S = ReadLine();
        int N = S.Length;
        var dp = new ModInt[N + 1, 2, 2];// (1,0 というペアか、0,0というペアか,)大がlessか、小がlessか,同じ数か
        dp[0, 0, 0] = 1;


        for (int i = 0; i < N; i++)
        {
            for (int j = 0; j < 2; j++)
            {
                int sumlim = j == 1 ? 1 : S[i] - '0';
                for (int d = 0; d < 2; d++)
                {
                    for (int l = 0; l <= 1; l++)
                    {
                        for (int r = 0; r <= 1; r++)
                        {
                            int sum = l + r;
                            int less = j | (sum < sumlim ? 1 : 0);
                            int diff = d | (l != r ? 1 : 0);

                            if (l == 1 && r == 1) continue;
                            if (l + r > sumlim) continue;
                            if (d == 0 && r < l) continue;

                            dp[i + 1, less, diff] += dp[i, j, d];
                        }
                    }
                }
            }
        }

        WriteLine(dp[N, 0, 0] + dp[N, 1, 0] + (dp[N, 0, 1] + dp[N, 1, 1]) * 2);

        //for (int i = 0; i < N; i++)
        //{
        //    for (int j = 0; j < 2; j++)
        //    {

        //        int limA = j == 1 ? 1 : S[i] - '0'; //Aのlim
        //        for (int k = 0; k < 2; k++)
        //        {
        //            int limB = k == 1 ? 1 : S[i] - '0';

        //            for (int d = 0; d < 2; d++)
        //            {
        //                for (int l = 0; l < limA + 1; l++)
        //                {
        //                    for (int r = 0; r < limB + 1; r++)
        //                    {
        //                        int lessA = j | (l < limA ? 1 : 0);
        //                        int lessB = k | (r < limB ? 1 : 0);
        //                        int diff = d | (l != r ? 1 : 0);
        //                        if (l == 1 && r == 1)
        //                        {
        //                            continue;
        //                        }
        //                        if (d == 0 && r < l)//A<=Bである必要。
        //                        {
        //                            continue;
        //                        }

        //                        WriteLine(i + " " + l + " " + r);
        //                        dp[i + 1, lessA, lessB, diff] += dp[i, j, k, d];
        //                    }
        //                }
        //            }

        //        }
        //    }
        //   // dp[i + 1, 1] *= 2;
        //}

        //var SAME = dp[N, 0, 0, 0] + dp[N, 1, 0, 0] + dp[N, 0, 1, 0] + dp[N, 1, 1, 0];
        //var DIFF = dp[N, 0, 0, 1] + dp[N, 1, 0, 1] + dp[N, 0, 1, 1] + dp[N, 1, 1, 1];

        ////WriteLine(SAME);
        ////WriteLine(DIFF);
        ////WriteLine(DIFF * 2 + SAME);


        //WriteLine(dp[N-1, 0, 0, 0]);
        //WriteLine(dp[N-1, 1, 0, 0]);
        //WriteLine(dp[N-1, 0, 1, 0]);
        //WriteLine(dp[N-1, 1, 1, 0]);
        //WriteLine(dp[N-1, 0, 0, 1]);
        //WriteLine(dp[N-1, 1, 0, 1]);
        //WriteLine(dp[N-1, 0, 1, 1]);
        //WriteLine(dp[N-1, 1, 1, 1]);
        //WriteLine();
        //WriteLine(dp[N, 0, 0, 0]);
        //WriteLine(dp[N, 1, 0, 0]);
        //WriteLine(dp[N, 0, 1, 0]);
        //WriteLine(dp[N, 1, 1, 0]);
        //WriteLine(dp[N, 0, 0, 1]);
        //WriteLine(dp[N, 1, 0, 1]);
        //WriteLine(dp[N, 0, 1, 1]);
        //WriteLine(dp[N, 1, 1, 1]);

        ////ModInt ans = dp[N, 0, 0];
        ////ans += dp[N, 1, 0];
        ////ans += dp[N, 0, 1];
        ////ans += dp[N, 1, 1];
        ////WriteLine(ans);
    }

}

/// <summary>
/// [0,<see cref="Mod"/>) までの値を取るような数
/// </summary>
/// <OriginalAuthor>camypaper</OriginalAuthor>
struct ModInt
{
    /// <summary>
    /// 剰余を取る値．
    /// </summary>
    public const long Mod = (int)1e9 + 7;

    /// <summary>
    /// 実際の数値．
    /// </summary>
    public long num;
    /// <summary>
    /// 値が <paramref name="n"/> であるようなインスタンスを構築します．
    /// </summary>
    /// <param name="n">インスタンスが持つ値</param>
    /// <remarks>パフォーマンスの問題上，コンストラクタ内では剰余を取りません．そのため，<paramref name="n"/> ∈ [0,<see cref="Mod"/>) を満たすような <paramref name="n"/> を渡してください．このコンストラクタは O(1) で実行されます．</remarks>
    public ModInt(long n) { num = n; }
    /// <summary>
    /// このインスタンスの数値を文字列に変換します．
    /// </summary>
    /// <returns>[0,<see cref="Mod"/>) の範囲内の整数を 10 進表記したもの．</returns>
    public override string ToString() { return num.ToString(); }
    public static ModInt operator +(ModInt l, ModInt r) { l.num += r.num; if (l.num >= Mod) l.num -= Mod; return l; }
    public static ModInt operator -(ModInt l, ModInt r) { l.num -= r.num; if (l.num < 0) l.num += Mod; return l; }
    public static ModInt operator *(ModInt l, ModInt r) { return new ModInt(l.num * r.num % Mod); }
    public static implicit operator ModInt(long n) { n %= Mod; if (n < 0) n += Mod; return new ModInt(n); }

    /// <summary>
    /// 与えられた 2 つの数値からべき剰余を計算します．
    /// </summary>
    /// <param name="v">べき乗の底</param>
    /// <param name="k">べき指数</param>
    /// <returns>繰り返し二乗法により O(N log N) で実行されます．</returns>
    public static ModInt Pow(ModInt v, long k) { return Pow(v.num, k); }

    /// <summary>
    /// 与えられた 2 つの数値からべき剰余を計算します．
    /// </summary>
    /// <param name="v">べき乗の底</param>
    /// <param name="k">べき指数</param>
    /// <returns>繰り返し二乗法により O(N log N) で実行されます．</returns>
    public static ModInt Pow(long v, long k)
    {
        long ret = 1;
        for (k %= Mod - 1; k > 0; k >>= 1, v = v * v % Mod)
            if ((k & 1) == 1) ret = ret * v % Mod;
        return new ModInt(ret);
    }
    /// <summary>
    /// 与えられた数の逆元を計算します．
    /// </summary>
    /// <param name="v">逆元を取る対象となる数</param>
    /// <returns>逆元となるような値</returns>
    /// <remarks>法が素数であることを仮定して，フェルマーの小定理に従って逆元を O(log N) で計算します．</remarks>
    public static ModInt Inverse(ModInt v) { return Pow(v, Mod - 2); }
}

class BinomialCoefficient
{
    public ModInt[] fact, ifact;
    /// <summary>
    /// <paramref name="n"/>は <paramref name="Mod"/>未満でお願いします。
    /// </summary>
    /// <param name="n"></param>
    public BinomialCoefficient(ModInt _n)
    {
        int n = (int)_n.num;
        fact = new ModInt[n + 1];
        ifact = new ModInt[n + 1];
        fact[0] = 1;
        for (int i = 1; i <= n; i++)
            fact[i] = fact[i - 1] * i;
        ifact[n] = ModInt.Inverse(fact[n]);
        for (int i = n - 1; i >= 0; i--)
            ifact[i] = ifact[i + 1] * (i + 1);
        ifact[0] = ifact[1];
    }
    public ModInt this[int n, int r]
    {
        get
        {
            if (n < 0 || n >= fact.Length || r < 0 || r > n) return 0;
            return fact[n] * ifact[n - r] * ifact[r];
        }
    }
    public ModInt RepeatedCombination(int n, int k)
    {
        if (k == 0) return 1;
        return this[n + k - 1, k];
    }
}

static class Ex
{
    public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values));
    public static string concat<T>(this IEnumerable<T> values) => string.Concat(values);
    public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); }

    public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
    public T f; public U s;
    public Pair(T f, U s) { this.f = f; this.s = s; }
    public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
    public override string ToString() => $"{f} {s}";
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan => ReadLine().Split();
    public int[] scanint => Array.ConvertAll(scan, int.Parse);
    public long[] scanlong => Array.ConvertAll(scan, long.Parse);
    public double[] scandouble => 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 => int.Parse(next);
    public long nextlong => long.Parse(next);
    public double nextdouble => double.Parse(next);
}


Measured memory_bytes: 14432