diff --git a/alphabetical_order.py b/alphabetical_order.py
new file mode 100644
index 0000000..3fb4555
--- /dev/null
+++ b/alphabetical_order.py
@@ -0,0 +1,9 @@
+##3-alphabetical_order.py
+
+def words ():
+    x, y, z, w = input("please enter four word:").split("-")
+    list=[x, y, z, w]
+    list.sort()
+    for i in list:
+        print(i,end="-")
+print(words())
\ No newline at end of file
diff --git a/equal_reverse.py b/equal_reverse.py
new file mode 100644
index 0000000..1e55dbd
--- /dev/null
+++ b/equal_reverse.py
@@ -0,0 +1,10 @@
+##5-equal_reverse.py
+
+def isPalindrome(s):
+    return s == s[::-1]
+s = input("enter a word :")
+ans = isPalindrome(s)
+if ans:
+    print("true")
+else:
+    print("false")
\ No newline at end of file
diff --git a/perfect_number.py b/perfect_number.py
new file mode 100644
index 0000000..c1bb43e
--- /dev/null
+++ b/perfect_number.py
@@ -0,0 +1,13 @@
+##1-perfect_number.py
+
+def perfect ():
+    perfectlist=[]
+    for i in range (1,1000):        
+        sum=0
+        for j in range (1,i):
+            if i%j==0:
+                sum +=j  # sum all divisor
+                if sum == i: # if sum of divisor equal to number it means number is perfect
+                    perfectlist.append(i)
+    return print(perfectlist)  
+print(perfect())  
\ No newline at end of file
diff --git a/reading_number.py b/reading_number.py
new file mode 100644
index 0000000..eb2d41a
--- /dev/null
+++ b/reading_number.py
@@ -0,0 +1,19 @@
+##2-reading_number.py
+
+def read ():
+    number = int(input("please enter a number:"))
+    ones=["", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"]
+    tens=["", "teen", "twenty", "thirty", "fourty", "fifty", "sixty", "seventy", "eighty", "ninety"]
+    one = number%10      # we find ones digit
+    ten = number//10     #we find tens digit
+    if ten == 1 and one == 1:    # for 11
+        return print("eleven")
+    elif ten ==1 and one == 2:  # for 12
+        return print("twelve")
+    elif ten ==1 and one == 3:  # for 13
+        return print("thirteen")
+    elif ten==1 and one != 1 and one !=2 and one != 3: #  without 10+(1, 2, 3) ; 14,15...
+        return print(ones[one], "teen")
+    else:
+        return print(tens[ten], ones[one]) # write without {} + teen. it is 20,21,22,... 
+print(read())
\ No newline at end of file
diff --git a/unique_list.py b/unique_list.py
new file mode 100644
index 0000000..7298507
--- /dev/null
+++ b/unique_list.py
@@ -0,0 +1,8 @@
+##4-unique_list.py
+# Write a function that filters all the unique(unrepeated) elements of a given list.
+
+def unique_list(test_list):
+    res = []
+    [res.append(x) for x in test_list if x not in res]
+    return res
+print (unique_list([1, 1, 1, 2, 2, 3, 3]))
\ No newline at end of file