For this Question: Given an integer N such that no digit of N is 0, find minimum numbers of digits that need to be removed from N such that N becomes divisible by 3. Note: if all the digits of N needs to removed report -1.Input contains a single integer N.

Constraints:
1 <= N <= 10^18
No digit of N is 0.Print the minimum number of digits that needs to removed to make N divisible by 3. Note: if all the digits of N needs to removed report -1.Sample Input 1
35

Sample Output 1
1

Explanation: we remove 5 from 35 making it 3.

Sample Input 2
44

Sample Output 2
-1

Explanation: As we have to remove all digits we report -1., I have written this Solution Code: 

number = input()


def divisible(num):
	n = len(num)

	sum_ = 0
	for i in range(n):
		sum_ += int(num[i])

	if (sum_ % 3 == 0):
		return 0

	if (n == 1):
		return -1

	for i in range(n):
		if (sum_ % 3 == int(num[i]) % 3):
			return 1

	if (n == 2):
		return -1

	return 2



print(divisible(number)), In this Programming Language: Python, Now tell me if this Code is compilable or not?