For this Question: Andy loves threes and fours and only likes numbers which are formed by threes and fours. Andy is curious about the Nth positive integer that Andy loves.First and only line of input contains a single integer N.

Constraints : 
1 <= N <= 1000000000000000Output should contain a single number, the Nth positive integer that Andy loves.Sample Input 1
1

Sample Output 1
3

Sample Input 2
3

Sample Output 2
33

Explanation:-
series is like 3, 4, 33, 34, 44, 333......, I have written this Solution Code: import math

N = int(input())
num_of_digits = int(math.log2(N+1))
nearest_number = pow(2,num_of_digits)-1

mask = bin(N-nearest_number)
string = ""
dic = {"0":"3","1":"4"}

for i in range(2,len(mask)):
	string += dic[mask[i]]

print("3"*(num_of_digits-(len(mask)-2)),end="")
print(string), In this Programming Language: Python, Now tell me if this Code is compilable or not?