print("hellur")

# question3.py
from itertools import product
V='∀'
E='∃'

def tt(f,n) :
  xss=product((0,1),repeat=n)
  print('function:',f.__name__)
  for xs in xss : print(*xs,':',int(f(*xs)))
  print('')

# this is the logic for part A (p\/q\/r) /\ (p\/q\/~r) /\ (p\/~q\/r) /\ (p\/~q\/~r) /\ (~p\/q\/r) /\ (~p\/q\/~r) /\ (~p\/~q\/r) /\ (~p\/~q\/~r)

def parta(p,q,r) :
  
  a=(p or q or r) and (p or q or not r) and (p or not q or r)and (p or not q or  not r)
  b=(not p or q or r ) and (not p or q or not r) and (not p or not q or r) and (not p or not q or not r)
  c= a and b
  return c

def partb(p,q,r) :
  a=(p or q and r) and (p or not q or not r) and (p or not q or not  r)and (p or q or  not r)
  b=(not p or q or r ) and (not p or q or not r) and (not p or not q or r) and (not p or not q or not r)
  c= a and b
  return c

print("part A:")
tt(parta,3)

print("part B:")
tt(partb,3)

#Python 3: Fibonacci series up to n
def fib(n):
 a, b = 0, 1
 while a < n:
     print(a, end=' ')
     a, b = b, a+b
 print()
fib(1000)

from time import sleep

def delay(fn, ms, *args):
  sleep(ms / 1000)
  return fn(*args)

delay(lambda x: print(x), 1000, 'later') # prints 'later' after one second

# List
lst = [1, 2, 3, 'Alice', 'Alice']

# One-Liner
indices = [i for i in range(len(lst)) if lst[i]=='Alice']

# Result
print(indices)
# [3, 4]

def Fibonacci(n): 
    if n<0: 
        print("Incorrect input") 
    # First Fibonacci number is 0 
    elif n==1: 
        return 0
    # Second Fibonacci number is 1 
    elif n==2: 
        return 1
    else: 
        return Fibonacci(n-1)+Fibonacci(n-2) 
  
# Driver Program 
  
print(Fibonacci(9))