prime

#!/usr/bin/python3

lower = int(input("Enter lower range: "))
upper = int(input("Enter upper range: "))
plst = []
slst = []
yes = 0


def main():
    lower = int(input("Enter lower range: "))
    upper = int(input("Enter upper range: "))
    plst = []
    slst = []
    yes = 0
    print("Prime numbers between", lower, "and", upper, "are: ")
    for num in range(lower, upper + 1):
        if num > 1:
            for i in range(2, num):
                if (num % i) == 0:
                    break
            else:
                print(num)
                plst.append(num)
    for prm in plst:
        prm = str(prm)
        slst.append(prm)
    for sprm in slst:
        if sprm != slst[-1]:
            nxtprm = slst[slst.index(sprm)-len(slst)+1]
            if nxtprm[-1] == sprm[-1]:
                yes += 1
        elif sprm == slst[-1]:
            pass
    pcnt = yes / len(plst) * 100
    print()
    print("Out of", len(slst), "prime numbers there is a")
    print(str(pcnt) + "%", "probability that the next prime number in the sequence")
    print("will end in the same digit as the prime number before it")
    quit()

if __name__ == '__main__':
  main()