weigh = lambda a,b: sum(b)-sum(a)
FindCoin = lambda A: 0 if (n := len(A)) == 1 else (m := n//3) * (w := 1 + weigh(A[:m], A[2*m:])) + FindCoin(A[m*w:m*(w+1)])
print(FindCoin([1,1,1,1,1,1,1,2,1]))

from statistics import median, mean, mode

def print_stats(array):
  print(array)
  print("median =", median(array))
  print("mean   =", mean(array))
  print("mode   =", mode(array))
  print()

print_stats([1, 2, 3, 3, 4])
print_stats([1, 2, 3, 3])

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

def generate_floyds_triangle(num_rows):
    triangle = []
    number = 1
    for row in range(num_rows):
        current_row = []
        for _ in range(row + 1):
            current_row.append(number)
            number += 1
        triangle.append(current_row)
    return triangle


def display_floyds_triangle(triangle):
    for row in triangle:
        for number in row:
            print(number, end=" ")
        print()


# Prompt the user for the number of rows
num_rows = int(input("Enter the number of rows for Floyd's Triangle: "))

# Generate Floyd's Triangle
floyds_triangle = generate_floyds_triangle(num_rows)

# Display Floyd's Triangle
display_floyds_triangle(floyds_triangle)

def bitonic_sort(arr, low, cnt, direction):
    ...