For this Question: Given an integer N, find all the numbers less than N which contains only digits 3, 4, and 5. Each digit should be present at least one time.The input contains a single integer N.

Constraints:-
1 <= N <= 1000000000Print the count of such numbers which contains only digits 3, 4, and 5.Sample Input:-
500

Sample Output:-
4

Explanation:-
345. 435. 453, 354

Sample Input:-
1000


Sample Output:-
6, I have written this Solution Code: import java.io.*;
import java.util.*;






class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long n = sc.nextLong();
        int count = recursive(n, 0, false, false, false);
        System.out.println(count);
    }

    private static int recursive(long n, long num, boolean three, boolean four, boolean five) {
        if(num > n){
            return 0;
        }
        int count = 0;
        if(three && four && five){
            count ++;
        }
        count += recursive(n, num*10 + 3, true, four, five);
        count += recursive(n, num*10 + 4, three, true, five);
        count += recursive(n, num*10 + 5, three, four, true);
        return count;
    }
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?