#include <stdio.h>
#include <string.h>

#define MOD 1000000007

int numUniqueGoodSubsequences(char* binary) {
    long long endsWithZero = 0;  // Count of unique subsequences ending with '0'
    long long endsWithOne = 0;   // Count of unique subsequences ending with '1'
    
    for (int i = 0; binary[i] != '\0'; i++) {
        if (binary[i] == '1') {
            // Append '1' to all existing subsequences
            endsWithOne = (endsWithZero + endsWithOne + 1) % MOD;
        } else { // binary[i] == '0'
            // Append '0' to all existing subsequences
            endsWithZero = (endsWithZero + endsWithOne) % MOD;
        }
    }
    
    // Add 1 if there's at least one '0' (for subsequence "0")
    int hasZero = strchr(binary, '0') != NULL ? 1 : 0;
    return (endsWithZero + endsWithOne + hasZero) % MOD;
}

int main() {
    char binary[100005];
    scanf("%s", binary);
    // Remove quotes if present
    if (binary[0] == '"') {
        int len = strlen(binary);
        memmove(binary, binary + 1, len - 2);
        binary[len - 2] = '\0';
    }
    printf("%d\n", numUniqueGoodSubsequences(binary));
    return 0;
}