# 1. Enter lowercase words and convert to a lista=input()# Input word: aASSDSSDFssscvbnb=list(a.lower()) # Convert to lowercase and then convert it to a list and assign it to b# print(b)# 2. Count the number of letters appearingcounts={} # define empty dictionaryfor word in b:# 2 lines of code statisticscounts[word] = counts.get(word,0) + 1print(counts)# The maximum value minus the minimum value counts.values() to get the valuedistance = max(counts.values()) - min(counts.values())print(distance)#Judgment of prime numbers: numbers greater than 1, division by 1 and itself cannot be divisiblefor i in range(2,distance):if distance % i ==0:print("No Answer")print(0)breakelse:print("Lucky Word")print(distance)break
