dessert = "chocolate"
topping = 'cherries'

print dessert
print topping
print str(3.1415)

len(dessert)

print 'chocolate' + 'cake'
print 'chocolate' * 3

dessert[0]

dessert[::-1]

print 'late' in 'chocolate'
print 'date' in 'chocolate'

prefixes = 'JKLMNOPQ'
suffix = 'ack'
for letter in prefixes:
    print letter + suffix

def is_palindrome(word):
    i = 0
    j = len(word) - 1
    while i < j:
        if word[i] != word[j]:
            return False
        i = i + 1
        j = j - 1
    return True

is_palindrome('tot')

print dessert.upper()
print dessert.find('o')

"Howdy! How are you today?".split()