def is_prime(i):
    if i == 1:
        print("prime")
    if i == 2:
        print("not prime")
    for d in range(2, i):
        if i % d != 0:
            d = d+1
            if d == i:
                print('prime')
                break
        if i % d == 0:
            print('not prime')
            break

def prime_counting(p):
    list_of_primes = []
    for n in range (p+1):
        if is_prime(n) == "prime":
            list_of_primes.append(n)

if is_prime(n) == True:
    list_of_primes.append(n)

if is_prime(n):
    list_of_primes.append(n)

if is_prime(n) == "prime":

def is_prime(i):
    if i == 1:
        return "prime"
    if i == 2:
        return "not prime"

    for d in range(2, i):
        if i % d != 0:
            d = d + 1
            if d == i:
                return "prime"
        if i % d == 0:
            return "not prime"


def prime_counting(p):
    list_of_primes = []
    for n in range(p+1):
        if is_prime(n) == "prime":
            print("added %s" % n)
            list_of_primes.append(n)
    return list_of_primes


if __name__ == '__main__':
    print(prime_counting(3))

if is_prime(n):
   do_something()