def find_generator(prime):
    for alpha in range(2, prime):
        found_numbers = []
        for exp in range(1, prime):
            computation = alpha ** exp % prime
            print("\t", alpha, "^", exp, "=", computation)
            if computation not in found_numbers:
                found_numbers.append(computation)
            else:
                break

        else:
            print(alpha)
        print("\n\n")

find_generator(int(input("What is Q? ")))
