if possible can this be done in python3

Given t queries: n1,...,nt, counting only { +, -, *, //,%, >,= }, determine the exact number of basic operations that would be performed when the following function foo is invoked on each value of ni. def bar(k): count = 0 for i in range (2, k): for j in range(1, i): if i % j == 0: count = count + 1 else: count = count - 1 return count def foo (n): if n == 0 : return 1 elif n % 3 == 0: v = foo (n // 3) t = 0 for i in range(n): t = t + V return t elif n % 3 == 1: v = foon - 1) return v + bar (n) else: v = foo(n 2) + foo (n - 2) return V + 1 Input Format Sign in - Google accounts Input Format A line containing the integer t Each of the next t lines contains a single integer ni Constraints 1