alphabet = ["A" "B" "C" "D" "E" "F" "G" "H" "I" "J" "K" "L" "M" "N" "O" "P" "Q" "R" "S" "T" "U" "V" "W" "X" "Y" "Z"]
print "Alphabet"
print alphabet
# Lets get the keyword
keyword = raw_input ("What is the keyword?: " )
print keyword
keyword = keyword.upper()
print keyword
alphabet.append(keyword)
print alphabet
# Now somehow remove repeated letters
# And place the keyword at the beggining

alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
keyword = raw_input().upper()
 
# You may want to check that the keyword contains only letters from A-Z
# if not keyword.isalpha():
#    do something
for letter in keyword: # remove keyword letters from alphabet
    alphabet = alphabet.replace(letter, "")
 
d = int(raw_input()) #displacement value/replace with stronger integer retrieval code. strVar.isdecimal() can help here.
cipher = alphabet[-d:] + keyword+ alphabet[:-d]

alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"

for letter in keyword: # remove keyword letters from alphabet
    alphabet = alphabet.replace(letter, "")

d = int(raw_input())

cipher = alphabet[-d:] + keyword+ alphabet[:-d]

alphabet = set("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
keyword = raw_input("Enter word ").upper()
difference = alphabet.difference(keyword)
 
## sets are in hash order not in alphabetical order
print "Hash sequence", difference, "\n"
 
## convert to a list so it can be sorted
difference = list(difference)    
difference.sort()
 
## now it is in alphabetical order
print "Alpha order", difference, "\n"
 
## create a new list with the keyword first
final_list = list(keyword) + difference
print "Final_list", final_list