Problem:
Score : 300 points

Problem Statement

You are given an integer N. Among the integers between 1 and N (inclusive), how many Shichi-Go-San numbers (literally "Seven-Five-Three numbers") are there?

Here, a Shichi-Go-San number is a positive integer that satisfies the following condition:

When the number is written in base ten, each of the digits 7, 5 and 3 appears at least once, and the other digits never appear.

Constraints

1 \leq N < 10^9

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

Print the number of the Shichi-Go-San numbers between 1 and N (inclusive).

Sample Input 1

575

Sample Output 1

4

There are four Shichi-Go-San numbers not greater than 575: 357, 375, 537 and 573.

Sample Input 2

3600

Sample Output 2

13

There are 13 Shichi-Go-San numbers not greater than 3600: the above four numbers, 735, 753, 3357, 3375, 3537, 3557, 3573, 3575 and 3577.

Sample Input 3

999999999

Sample Output 3

26484

Solution in JavaScript (node.js v5.12) (judge verdict: Runtime Error)

'use strict'

function Main(input) {
    const N = parseInt(input.trim())
    const faces = [7, 5, 3]
    const base = faces.length
    const combos = new Array(N.toString().length - base + 1)
        .fill(0)
        .map((x, i) => getCombos(base, base + i))
        .reduce((acc, val) => acc.concat(val), [])
        .filter(combo => {
            //console.log(combo)
            const condA = parseInt(combo.map(x => faces[x]).join('')) <= N
            const condB = new Array(base)
                .fill(0)
                .every((x, i) => combo.indexOf(i) !== -1)
            return condA && condB
        })
    const output = combos.length
    console.log(output)
}

function getCombos(base, length) {
    const combos = [new Array(length).fill(0)]
    const num = Math.pow(base, length)
    for (let i = 1; i < num; i++) {
        const c = Array.from(combos[i - 1])
        increment(c, base)
        combos.push(c)
    }
    return combos
}

function increment(combo, base) {
    combo[0] += 1
    for (let i = 0; i < combo.length - 1; i++) {
        if (combo[i] === base) {
            combo[i] = 0
            combo[i + 1] += 1
        }
    }
}

Main(require("fs").readFileSync("/dev/stdin", "utf8"));