primeFinder.py

arr = {}


def main():
    print("Range: ")
    r = int(input())

    # For each number 0-r
    # If number not yet marked off
    # mark all multiples of the number that are under r

    for i in range(2, r):
        if i not in arr:
            x = 2
            while i * x < r:
                arr[i * x] = True
                x = x + 1

    # Print out our primes
    for i in range(2, r):
        if i not in arr:
            print(i)


if __name__ == '__main__':
    main()