1.

Write a Python program to find the Cartesian product of

two sets.
set1 = {1, 2}
set2 = {'a', 'b'}
cartesian_product = []
for i in set1:
for j in set2:
cartesian_product.append((i,j))
print("cartesian product of two sets:",set(cartesian_product))

cartesian product of two sets: {(2, 'a'), (2, 'b'), (1, 'a'), (1,
'b')}

2. Write a Python program to check if two sets are disjoint

(have no common elements).
Set1 = {1, 2, 3}
Set2 = {4, 5, 6}
if Set1 & Set2==set():
print("True")
else:
print("False")

True

3. Write a Python program to implement the power set (all

possible subsets) of a given set.
def power_set(input_set):
lst = list(input_set)
n = len(lst)
result = [[]]

for element in lst:

new_subsets = []
for subset in result:
new_subsets.append(subset)
new_subsets.append(subset + [element])
result = new_subsets

return result
input_set = {1, 2, 3}
result = power_set(input_set)
print(result)

[[], [3], [2], [2, 3], [1], [1, 3], [1, 2], [1, 2, 3]]
4. Write a Python program to find the longest consecutive
subsequence in a set.
input_set = {100,4 ,200, 1, 3, 2}
if not input_set:
longest_subsequence = []
else:
sorted_set = sorted(input_set)
longest_subsequence = []
current_subsequence = [sorted_set[0]]
for i in range(1, len(sorted_set)):
if sorted_set[i] == sorted_set[i - 1] + 1:
current_subsequence.append(sorted_set[i])
else:
if len(current_subsequence) > len(longest_subsequence):
longest_subsequence = current_subsequence
current_subsequence = [sorted_set[i]]
if len(current_subsequence) > len(longest_subsequence):
longest_subsequence =set(current_subsequence)

print(longest_subsequence)

[1, 2, 3, 4]

5. Write a Python program to find the number of elements

in the largest subset of a set where no two elements are
adjacent to each other.
input_set = {1, 2, 3, 4, 5}

if not input_set:
result = 0
else:
sorted_set = sorted(input_set)
n = len(sorted_set)

prev = 0
current = 0

for i in range(n):
new_current = max(prev + sorted_set[i], current)
prev = current
current = new_current

result = current

print(result)
9

6. Write a Python program to perform set operations on a

list of sets (union, intersection, difference).
set1 = {1, 2, 3}
set2 = {3, 4, 5}
set3 = {5, 6, 7}
set_list = [set1, set2, set3]
union = set.union(*set_list)
intersection = set.intersection(*set_list)
difference= set1.difference(set2,set3)
print("Union:", union)
print("Intersection:", intersection)
print("Difference:", difference)

Union: {1, 2, 3, 4, 5, 6, 7}
Intersection: set()
Difference: {1, 2}

7. Write a Python program to find the second smallest

element in a set.
input_set = {5,2,8,1,9,3}
sorted_list = sorted(input_set)
if len(sorted_list) >= 2:
second_smallest = sorted_list[1]
print("Second Smallest Element:", second_smallest)
else:
print("Set doesn't have a second smallest element.")

Second Smallest Element: 2

8. Write a Python program to find the symmetric

difference between multiple sets.
set1 = {1, 2, 3}
set2 = {3, 4, 5}
set3 = {5, 6, 7}
set_list=[set1,set2,set3]
symmetric_diff =
set1.symmetric_difference(set2).symmetric_difference(set3)
print(symmetric_diff)
{1, 2, 4, 6, 7}

9. Write a Python program to find the sum of all elements

in the union of two sets, excluding elements that are
common to both sets.
set1 = {1, 2, 3}
set2 = {3, 4, 5}
union= set1.union(set2)
sum= 0
for i in union:
if i not in set1 or i not in set2:
sum+=i
print("Sum of all elements in the union of two sets, excluding common
elements:", sum)

Sum of all elements in the union of two sets, excluding common

elements: 12

10. Write a Python program to create a set of all possible

anagrams of a given word.
from itertools import permutations
def get_all_anagrams(word):
word = word.replace(" ", "").lower()
perms = permutations(word)
anagrams = {''.join(perm) for perm in perms}
return anagrams
input_word = input("Enter a word: ")
anagrams = get_all_anagrams(input_word)
print("All possible anagrams of", input_word, "are:")
print(anagrams)

Enter a word: listen

All possible anagrams of listen are:
{'iseltn', 'lisnet', 'lntsie', 'elisnt', 'inltse', 'telsni', 'nstiel',
'lnetsi', 'eilsnt', 'etisnl', 'snelit', 'tisenl', 'tseiln', 'ntslie',
'eislnt', 'istlne', 'ntilse', 'eslitn', 'ientls', 'nltesi', 'etnsli',
'itelns', 'ietsln', 'iesltn', 'eisltn', 'etsinl', 'tsienl', 'nletis',
'ensilt', 'lstnie', 'enltis', 'slinet', 'ilntes', 'ntslei', 'stilen',
'nleist', 'snitel', 'snetil', 'lseint', 'itelsn', 'tinsel', 'teslni',
'nltise', 'isntel', 'tlsein', 'slietn', 'intesl', 'isenlt', 'intsel',
'sentil', 'elitsn', 'ilsetn', 'intlse', 'ltiens', 'enilts', 'litsne',
'tliesn', 'nletsi', 'silten', 'nitsel', 'tilnes', 'ntiesl', 'eitsnl',
'lniest', 'nliste', 'snelti', 'iletsn', 'siltne', 'ieltsn', 'teinls',
'ntseli', 'ilnset', 'ieslnt', 'etsnli', 'tilnse', 'tislne', 'selitn',
'tnlsie', 'lenist', 'elints', 'nelsit', 'teisnl', 'tesinl', 'linest',
'isetnl', 'liesnt', 'etnisl', 'niltes', 'seiltn', 'snetli', 'senlti',
'iltens', 'enlits', 'snilte', 'nisetl', 'ltnsie', 'itlnse', 'tsenil',
'neilts', 'tslnei', 'nlseti', 'sltnie', 'nlstei', 'seinlt', 'nlsiet',
'stnlie', 'eistln', 'lnitse', 'ntseil', 'nelits', 'lsteni', 'ilsent',
'setiln', 'tsinle', 'itlsen', 'lntsei', 'lnstie', 'siletn', 'elnits',
'etslin', 'neslit', 'sinlet', 'eltnsi', 'nsielt', 'itlsne', 'ineslt',
'tlneis', 'istnel', 'sntile', 'sientl', 'liestn', 'slneit', 'lintse',
'istenl', 'selnit', 'lntesi', 'lsient', 'sliten', 'sitnel', 'nistel',
'nsleit', 'tliens', 'sntiel', 'eilnst', 'tesnil', 'islnet', 'nielst',
'ilstne', 'lstien', 'ienslt', 'slntie', 'ilntse', 'inltes', 'lsetni',
'ntlesi', 'eisntl', 'lsniet', 'netsli', 'tensli', 'ienlts', 'eltisn',
'nleits', 'instel', 'stlein', 'lienst', 'sneitl', 'sinelt', 'litens',
'esiltn', 'sltien', 'eilstn', 'seltni', 'inselt', 'seitnl', 'ntleis',
'itlesn', 'itslen', 'lentsi', 'tsenli', 'ielsnt', 'tselin', 'inlset',
'slenti', 'nsitle', 'lsneit', 'lstine', 'insetl', 'tinesl', 'etnlsi',
'tlnies', 'elnsti', 'ntelis', 'tlnise', 'sitenl', 'setnil', 'tnisle',
'teisln', 'ienstl', 'eltsni', 'etnlis', 'etnils', 'neitsl', 'ltsein',
'lesitn', 'tlnsie', 'esntli', 'enstil', 'iltesn', 'lsntei', 'sielnt',
'iltnse', 'tsneli', 'ltnise', 'setlni', 'stinle', 'letsni', 'eitnls',
'nitlse', 'nitesl', 'ntesil', 'netisl', 'sltein', 'nitels', 'nselti',
'stlnei', 'lsinte', 'telisn', 'ltisen', 'sletni', 'etisln', 'tnlesi',
'tniles', 'nsteil', 'lneist', 'tnilse', 'nitsle', 'tsinel', 'lestin',
'ilsnte', 'lntise', 'eltsin', 'sentli', 'tsneil', 'elstin', 'snleit',
'eistnl', 'tlnesi', 'nsilte', 'itesnl', 'tleisn', 'itensl', 'stilne',
'slneti', 'itnsel', 'tlisne', 'sitnle', 'nlsite', 'slnite', 'lsetin',
'nestli', 'sitlen', 'ietlsn', 'tneisl', 'esltin', 'nilets', 'esintl',
'stienl', 'elnsit', 'telsin', 'leitsn', 'nielts', 'sinetl', 'stneil',
'eltnis', 'nilest', 'ietnls', 'snitle', 'enilst', 'enitls', 'lietns',
'isntle', 'entsil', 'nislte', 'nlesti', 'netils', 'eitsln', 'teilsn',
'lesint', 'itnles', 'linets', 'snielt', 'tsilne', 'tlsnei', 'lniste',
'teilns', 'tnisel', 'iltsen', 'entlsi', 'ienlst', 'lnetis', 'ntsiel',
'lensti', 'slntei', 'nsltei', 'iltnes', 'snteli', 'ilesnt', 'eslnti',
'tnelis', 'steiln', 'enistl', 'lneits', 'tniels', 'stline', 'inetsl',
'nsleti', 'tenils', 'nstlei', 'eslint', 'sintel', 'slitne', 'lnseti',
'inelst', 'ielstn', 'lisetn', 'elnist', 'ilenst', 'esnilt', 'isltne',
'nsietl', 'seltin', 'slient', 'lietsn', 'tslnie', 'ilnets', 'stieln',
'stelin', 'snietl', 'itesln', 'neislt', 'tnlise', 'elsnti', 'nstile',
'ensitl', 'ilestn', 'neilst', 'teslin', 'linste', 'ltseni', 'ientsl',
'einlts', 'telnis', 'itlnes', 'tnsile', 'nlties', 'snilet', 'nliets',
'tinles', 'esnlit', 'enlsti', 'ntiels', 'ltsnei', 'ntelsi', 'tsline',
'etlsni', 'nlitse', 'ntlies', 'tnsiel', 'lestni', 'slniet', 'sleitn',
'lients', 'eiltns', 'esntil', 'letisn', 'tnesli', 'tenisl', 'eisnlt',
'nsteli', 'tesnli', 'tlsien', 'lnseit', 'setlin', 'esnlti', 'islten',
'intsle', 'lesnti', 'esinlt', 'nltsie', 'leinst', 'eintsl', 'nslite',
'neitls', 'inestl', 'tslien', 'tnseli', 'sntlei', 'ltnesi', 'stenil',
'lnesit', 'nilste', 'nesilt', 'itsnel', 'inlets', 'tinlse', 'tensil',
'nltsei', 'nsliet', 'ietnsl', 'tnseil', 'tilsne', 'leitns', 'netlis',
'elitns', 'lniets', 'itslne', 'tlesni', 'slenit', 'litnes', 'listen',
'tlseni', 'iselnt', 'sienlt', 'lteins', 'iletns', 'linset', 'ltisne',
'ilents', 'ltiesn', 'tnslei', 'ltenis', 'isetln', 'lentis', 'itnlse',
'setinl', 'nlseit', 'nseilt', 'nsitel', 'eltins', 'eiltsn', 'listne',
'enslit', 'ltinse', 'elsint', 'tiseln', 'ilsten', 'estlin', 'tsniel',
'enstli', 'nislet', 'nteisl', 'seitln', 'ntiles', 'lisnte', 'tnlies',
'itnsle', 'stlien', 'nlites', 'tisnle', 'ltsien', 'tnelsi', 'lstnei',
'stnlei', 'elinst', 'lstein', 'ltesin', 'tlsine', 'ntlsie', 'stinel',
'itnesl', 'snteil', 'elntis', 'ilnest', 'leistn', 'inlest', 'senlit',
'nilset', 'tilens', 'nsetil', 'isnelt', 'sletin', 'nseitl', 'netlsi',
'sintle', 'lesnit', 'sntlie', 'itlens', 'tlnsei', 'snltie', 'estinl',
'tsilen', 'tlinse', 'iltsne', 'ltensi', 'stnile', 'etslni', 'lteisn',
'letins', 'tseinl', 'seintl', 'etlsin', 'isnlte', 'tleins', 'esilnt',
'itsenl', 'isnlet', 'enltsi', 'senilt', 'teinsl', 'ltnies', 'nstlie',
'islnte', 'stniel', 'sitlne', 'stleni', 'setnli', 'litnse', 'tsnlei',
'ntesli', 'einslt', 'ntsile', 'tienls', 'etilsn', 'nlteis', 'lsntie',
'enitsl', 'snleti', 'entils', 'stlnie', 'iestln', 'tesiln', 'enlsit',
'lsietn', 'nelist', 'siteln', 'isnetl', 'lseitn', 'lsenti', 'ltines',
'tselni', 'sietln', 'tenlis', 'tlesin', 'isletn', 'lnites', 'tnleis',
'elistn', 'niestl', 'lsinet', 'slinte', 'ltnsei', 'elsnit', 'eintls',
'nesitl', 'eitnsl', 'inlste', 'lsiten', 'ilsnet', 'instle', 'ietlns',
'silnte', 'lsitne', 'silnet', 'ntlsei', 'ntisle', 'etinls', 'netsil',
'sietnl', 'tlines', 'istnle', 'isentl', 'tnlsei', 'telins', 'entsli',
'lnesti', 'ntlise', 'islent', 'enlist', 'isteln', 'elstni', 'nsetli',
'etinsl', 'nselit', 'estnil', 'tlensi', 'sneilt', 'slteni', 'niltse',
'einstl', 'letnsi', 'ltneis', 'tiesln', 'steinl', 'etsnil', 'estiln',
'entlis', 'neltis', 'enslti', 'ielnst', 'nistle', 'tielns', 'inetls',
'eilnts', 'lnsiet', 'lisent', 'lniset', 'ltsnie', 'tneils', 'seilnt',
'tlsnie', 'estnli', 'stenli', 'inelts', 'nieslt', 'esitln', 'sinlte',
'tsnile', 'nlesit', 'neistl', 'itsnle', 'stneli', 'etilns', 'litsen',
'tlenis', 'snliet', 'tnesil', 'nlstie', 'tlisen', 'tiesnl', 'niselt',
'etlnis', 'leisnt', 'tiensl', 'eitlsn', 'letnis', 'ielnts', 'senitl',
'tsnlie', 'tilsen', 'enislt', 'itnels', 'tielsn', 'etsiln', 'ieltns',
'nestil', 'nliest', 'neltsi', 'tslein', 'lsnite', 'selint', 'ltsine',
'entisl', 'snlite', 'tsleni', 'lenits', 'nietls', 'iesntl', 'telnsi',
'etlins', 'ietsnl', 'ltesni', 'ilnste', 'stelni', 'eslnit', 'tilesn',
'lintes', 'selnti', 'tisnel', 'tenlsi', 'tnslie', 'etnsil', 'litesn',
'esltni', 'nteils', 'estlni', 'lsneti', 'istlen', 'sltnei', 'nelsti',
'intels', 'tinels', 'esitnl', 'nitles', 'elntsi', 'ntisel', 'itseln',
'tislen', 'esnitl', 'elsitn', 'lnstei', 'intles', 'iesnlt', 'sltine',
'tniesl', 'eitlns', 'inslet', 'leints', 'lnsite', 'tsieln', 'nietsl',
'neslti', 'tinsle', 'lsenit', 'lnteis', 'nliset', 'einlst', 'inslte',
'nsltie', 'etlisn', 'itenls', 'sleint', 'etlnsi', 'sieltn', 'letsin',
'silent', 'lnties', 'nsilet', 'iestnl', 'snltei', 'lensit'}

11. Write a Python program to find the Cartesian product of

two sets.
set1 = {1, 2}
set2 = {'a', 'b'}
cartesian_product = {(x, y) for x in set1 for y in set2}
print("Cartesian product of two sets:", cartesian_product)

Cartesian product of two sets: {(2, 'a'), (2, 'b'), (1, 'a'), (1,
'b')}

12. Write a Python program to check if two sets are disjoint

(have no common elements).
set1 = {1, 2, 3}
set2 = {4,5, 6}
if not set1.intersection(set2):
print("True")
else:
print("False")

True

13. Write a Python program to implement the power set

(all possible subsets) of a given set.
def power_set(input_set):
lst = list(input_set)
n = len(lst)
result = [[]]

for element in lst:

new_subsets = []
for subset in result:
new_subsets.append(subset)
new_subsets.append(subset + [element])
result = new_subsets

return result
input_set = {1, 2, 3}
result = power_set(input_set)
print(result)

[[], [3], [2], [2, 3], [1], [1, 3], [1, 2], [1, 2, 3]]

14. Write a Python program to find the longest consecutive

subsequence in a set
input_set = {100,4 ,200, 1, 3, 2}
if not input_set:
longest_subsequence = []
else:
sorted_set = sorted(input_set)
longest_subsequence = []
current_subsequence = [sorted_set[0]]
for i in range(1, len(sorted_set)):
if sorted_set[i] == sorted_set[i - 1] + 1:
current_subsequence.append(sorted_set[i])
else:
if len(current_subsequence) > len(longest_subsequence):
longest_subsequence = current_subsequence
current_subsequence = [sorted_set[i]]
if len(current_subsequence) > len(longest_subsequence):
longest_subsequence =set(current_subsequence)
print(longest_subsequence)

[1, 2, 3, 4]

15. Write a Python program to find the number of

elements in the largest subset of a set where no two
elements are adjacent to each other.
input_set = {1, 2, 3, 4, 5}
if not input_set:
result = 0
else:
sorted_set = sorted(input_set)
n = len(sorted_set)
prev = 0
current = 0
for i in range(n):
new_current = max(prev + sorted_set[i], current)
prev = current
current = new_current
result = current
print(result)

16. Write a Python program to perform set operations on a

list of sets (union, intersection, difference).
set1 = {1, 2, 3}
set2 = {3, 4, 5}
set3 = {5, 6, 7}
set_list = [set1, set2, set3]
union = set.union(*set_list)
intersection = set.intersection(*set_list)
difference= set1.difference(set2,set3)
print("Union:", union)
print("Intersection:", intersection)
print("Difference:", difference)

Union: {1, 2, 3, 4, 5, 6, 7}
Intersection: set()
Difference: {1, 2}

17. Write a Python program to find the second smallest

element in a set.
def second_smallest(nums):
sorted_nums = sorted(nums)
return sorted_nums[1]
input_set = {5, 2, 9, 1, 6, 4}
second_smallest_set = second_smallest(input_set)
print("the second smallest element:",second_smallest_set)

the second smallest element: 2

18. Write a Python program to find the symmetric

difference between multiple sets.
set1 = {1, 2, 3}
set2 = {3, 4, 5}
set3 = {5, 6, 7}
symmetric_diff =
set1.symmetric_difference(set2).symmetric_difference(set3)
print("Symmetric Difference:", symmetric_diff)

Symmetric Difference: {1, 2, 4, 6, 7}

19. Write a Python program to find the sum of all elements

in the union of two sets, excluding elements that are
common to both sets.
set1 = {1, 2, 3}
set2 = {3, 4, 5}
union= set1.union(set2)
sum= 0
for i in union:
if i not in set1 or i not in set2:
sum+=i
print("Sum of all elements in the union of two sets, excluding common
elements:", sum)
Sum of all elements in the union of two sets, excluding common
elements: 12

20. Write a Python program to create a set of all possible

anagrams of a given word.
from itertools import permutations
def get_all_anagrams(word):
word = word.replace(" ", "").lower()
perms = permutations(word)
anagrams = {''.join(perm) for perm in perms}
return anagrams
input_word = input("Enter a word: ")
anagrams = get_all_anagrams(input_word)
print("All possible anagrams of", input_word, "are:")
print(anagrams)

Enter a word: listen

All possible anagrams of listen are:
{'iseltn', 'lisnet', 'lntsie', 'elisnt', 'inltse', 'telsni', 'nstiel',
'lnetsi', 'eilsnt', 'etisnl', 'snelit', 'tisenl', 'tseiln', 'ntslie',
'eislnt', 'istlne', 'ntilse', 'eslitn', 'ientls', 'nltesi', 'etnsli',
'itelns', 'ietsln', 'iesltn', 'eisltn', 'etsinl', 'tsienl', 'nletis',
'ensilt', 'lstnie', 'enltis', 'slinet', 'ilntes', 'ntslei', 'stilen',
'nleist', 'snitel', 'snetil', 'lseint', 'itelsn', 'tinsel', 'teslni',
'nltise', 'isntel', 'tlsein', 'slietn', 'intesl', 'isenlt', 'intsel',
'sentil', 'elitsn', 'ilsetn', 'intlse', 'ltiens', 'enilts', 'litsne',
'tliesn', 'nletsi', 'silten', 'nitsel', 'tilnes', 'ntiesl', 'eitsnl',
'lniest', 'nliste', 'snelti', 'iletsn', 'siltne', 'ieltsn', 'teinls',
'ntseli', 'ilnset', 'ieslnt', 'etsnli', 'tilnse', 'tislne', 'selitn',
'tnlsie', 'lenist', 'elints', 'nelsit', 'teisnl', 'tesinl', 'linest',
'isetnl', 'liesnt', 'etnisl', 'niltes', 'seiltn', 'snetli', 'senlti',
'iltens', 'enlits', 'snilte', 'nisetl', 'ltnsie', 'itlnse', 'tsenil',
'neilts', 'tslnei', 'nlseti', 'sltnie', 'nlstei', 'seinlt', 'nlsiet',
'stnlie', 'eistln', 'lnitse', 'ntseil', 'nelits', 'lsteni', 'ilsent',
'setiln', 'tsinle', 'itlsen', 'lntsei', 'lnstie', 'siletn', 'elnits',
'etslin', 'neslit', 'sinlet', 'eltnsi', 'nsielt', 'itlsne', 'ineslt',
'tlneis', 'istnel', 'sntile', 'sientl', 'liestn', 'slneit', 'lintse',
'istenl', 'selnit', 'lntesi', 'lsient', 'sliten', 'sitnel', 'nistel',
'nsleit', 'tliens', 'sntiel', 'eilnst', 'tesnil', 'islnet', 'nielst',
'ilstne', 'lstien', 'ienslt', 'slntie', 'ilntse', 'inltes', 'lsetni',
'ntlesi', 'eisntl', 'lsniet', 'netsli', 'tensli', 'ienlts', 'eltisn',
'nleits', 'instel', 'stlein', 'lienst', 'sneitl', 'sinelt', 'litens',
'esiltn', 'sltien', 'eilstn', 'seltni', 'inselt', 'seitnl', 'ntleis',
'itlesn', 'itslen', 'lentsi', 'tsenli', 'ielsnt', 'tselin', 'inlset',
'slenti', 'nsitle', 'lsneit', 'lstine', 'insetl', 'tinesl', 'etnlsi',
'tlnies', 'elnsti', 'ntelis', 'tlnise', 'sitenl', 'setnil', 'tnisle',
'teisln', 'ienstl', 'eltsni', 'etnlis', 'etnils', 'neitsl', 'ltsein',
'lesitn', 'tlnsie', 'esntli', 'enstil', 'iltesn', 'lsntei', 'sielnt',
'iltnse', 'tsneli', 'ltnise', 'setlni', 'stinle', 'letsni', 'eitnls',
'nitlse', 'nitesl', 'ntesil', 'netisl', 'sltein', 'nitels', 'nselti',
'stlnei', 'lsinte', 'telisn', 'ltisen', 'sletni', 'etisln', 'tnlesi',
'tniles', 'nsteil', 'lneist', 'tnilse', 'nitsle', 'tsinel', 'lestin',
'ilsnte', 'lntise', 'eltsin', 'sentli', 'tsneil', 'elstin', 'snleit',
'eistnl', 'tlnesi', 'nsilte', 'itesnl', 'tleisn', 'itensl', 'stilne',
'slneti', 'itnsel', 'tlisne', 'sitnle', 'nlsite', 'slnite', 'lsetin',
'nestli', 'sitlen', 'ietlsn', 'tneisl', 'esltin', 'nilets', 'esintl',
'stienl', 'elnsit', 'telsin', 'leitsn', 'nielts', 'sinetl', 'stneil',
'eltnis', 'nilest', 'ietnls', 'snitle', 'enilst', 'enitls', 'lietns',
'isntle', 'entsil', 'nislte', 'nlesti', 'netils', 'eitsln', 'teilsn',
'lesint', 'itnles', 'linets', 'snielt', 'tsilne', 'tlsnei', 'lniste',
'teilns', 'tnisel', 'iltsen', 'entlsi', 'ienlst', 'lnetis', 'ntsiel',
'lensti', 'slntei', 'nsltei', 'iltnes', 'snteli', 'ilesnt', 'eslnti',
'tnelis', 'steiln', 'enistl', 'lneits', 'tniels', 'stline', 'inetsl',
'nsleti', 'tenils', 'nstlei', 'eslint', 'sintel', 'slitne', 'lnseti',
'inelst', 'ielstn', 'lisetn', 'elnist', 'ilenst', 'esnilt', 'isltne',
'nsietl', 'seltin', 'slient', 'lietsn', 'tslnie', 'ilnets', 'stieln',
'stelin', 'snietl', 'itesln', 'neislt', 'tnlise', 'elsnti', 'nstile',
'ensitl', 'ilestn', 'neilst', 'teslin', 'linste', 'ltseni', 'ientsl',
'einlts', 'telnis', 'itlnes', 'tnsile', 'nlties', 'snilet', 'nliets',
'tinles', 'esnlit', 'enlsti', 'ntiels', 'ltsnei', 'ntelsi', 'tsline',
'etlsni', 'nlitse', 'ntlies', 'tnsiel', 'lestni', 'slniet', 'sleitn',
'lients', 'eiltns', 'esntil', 'letisn', 'tnesli', 'tenisl', 'eisnlt',
'nsteli', 'tesnli', 'tlsien', 'lnseit', 'setlin', 'esnlti', 'islten',
'intsle', 'lesnti', 'esinlt', 'nltsie', 'leinst', 'eintsl', 'nslite',
'neitls', 'inestl', 'tslien', 'tnseli', 'sntlei', 'ltnesi', 'stenil',
'lnesit', 'nilste', 'nesilt', 'itsnel', 'inlets', 'tinlse', 'tensil',
'nltsei', 'nsliet', 'ietnsl', 'tnseil', 'tilsne', 'leitns', 'netlis',
'elitns', 'lniets', 'itslne', 'tlesni', 'slenit', 'litnes', 'listen',
'tlseni', 'iselnt', 'sienlt', 'lteins', 'iletns', 'linset', 'ltisne',
'ilents', 'ltiesn', 'tnslei', 'ltenis', 'isetln', 'lentis', 'itnlse',
'setinl', 'nlseit', 'nseilt', 'nsitel', 'eltins', 'eiltsn', 'listne',
'enslit', 'ltinse', 'elsint', 'tiseln', 'ilsten', 'estlin', 'tsniel',
'enstli', 'nislet', 'nteisl', 'seitln', 'ntiles', 'lisnte', 'tnlies',
'itnsle', 'stlien', 'nlites', 'tisnle', 'ltsien', 'tnelsi', 'lstnei',
'stnlei', 'elinst', 'lstein', 'ltesin', 'tlsine', 'ntlsie', 'stinel',
'itnesl', 'snteil', 'elntis', 'ilnest', 'leistn', 'inlest', 'senlit',
'nilset', 'tilens', 'nsetil', 'isnelt', 'sletin', 'nseitl', 'netlsi',
'sintle', 'lesnit', 'sntlie', 'itlens', 'tlnsei', 'snltie', 'estinl',
'tsilen', 'tlinse', 'iltsne', 'ltensi', 'stnile', 'etslni', 'lteisn',
'letins', 'tseinl', 'seintl', 'etlsin', 'isnlte', 'tleins', 'esilnt',
'itsenl', 'isnlet', 'enltsi', 'senilt', 'teinsl', 'ltnies', 'nstlie',
'islnte', 'stniel', 'sitlne', 'stleni', 'setnli', 'litnse', 'tsnlei',
'ntesli', 'einslt', 'ntsile', 'tienls', 'etilsn', 'nlteis', 'lsntie',
'enitsl', 'snleti', 'entils', 'stlnie', 'iestln', 'tesiln', 'enlsit',
'lsietn', 'nelist', 'siteln', 'isnetl', 'lseitn', 'lsenti', 'ltines',
'tselni', 'sietln', 'tenlis', 'tlesin', 'isletn', 'lnites', 'tnleis',
'elistn', 'niestl', 'lsinet', 'slinte', 'ltnsei', 'elsnit', 'eintls',
'nesitl', 'eitnsl', 'inlste', 'lsiten', 'ilsnet', 'instle', 'ietlns',
'silnte', 'lsitne', 'silnet', 'ntlsei', 'ntisle', 'etinls', 'netsil',
'sietnl', 'tlines', 'istnle', 'isentl', 'tnlsei', 'telins', 'entsli',
'lnesti', 'ntlise', 'islent', 'enlist', 'isteln', 'elstni', 'nsetli',
'etinsl', 'nselit', 'estnil', 'tlensi', 'sneilt', 'slteni', 'niltse',
'einstl', 'letnsi', 'ltneis', 'tiesln', 'steinl', 'etsnil', 'estiln',
'entlis', 'neltis', 'enslti', 'ielnst', 'nistle', 'tielns', 'inetls',
'eilnts', 'lnsiet', 'lisent', 'lniset', 'ltsnie', 'tneils', 'seilnt',
'tlsnie', 'estnli', 'stenli', 'inelts', 'nieslt', 'esitln', 'sinlte',
'tsnile', 'nlesit', 'neistl', 'itsnle', 'stneli', 'etilns', 'litsen',
'tlenis', 'snliet', 'tnesil', 'nlstie', 'tlisen', 'tiesnl', 'niselt',
'etlnis', 'leisnt', 'tiensl', 'eitlsn', 'letnis', 'ielnts', 'senitl',
'tsnlie', 'tilsen', 'enislt', 'itnels', 'tielsn', 'etsiln', 'ieltns',
'nestil', 'nliest', 'neltsi', 'tslein', 'lsnite', 'selint', 'ltsine',
'entisl', 'snlite', 'tsleni', 'lenits', 'nietls', 'iesntl', 'telnsi',
'etlins', 'ietsnl', 'ltesni', 'ilnste', 'stelni', 'eslnit', 'tilesn',
'lintes', 'selnti', 'tisnel', 'tenlsi', 'tnslie', 'etnsil', 'litesn',
'esltni', 'nteils', 'estlni', 'lsneti', 'istlen', 'sltnei', 'nelsti',
'intels', 'tinels', 'esitnl', 'nitles', 'elntsi', 'ntisel', 'itseln',
'tislen', 'esnitl', 'elsitn', 'lnstei', 'intles', 'iesnlt', 'sltine',
'tniesl', 'eitlns', 'inslet', 'leints', 'lnsite', 'tsieln', 'nietsl',
'neslti', 'tinsle', 'lsenit', 'lnteis', 'nliset', 'einlst', 'inslte',
'nsltie', 'etlisn', 'itenls', 'sleint', 'etlnsi', 'sieltn', 'letsin',
'silent', 'lnties', 'nsilet', 'iestnl', 'snltei', 'lensit'}