diff --git a/Bisection.py b/ArithmeticAnalysis/Bisection.py
similarity index 100%
rename from Bisection.py
rename to ArithmeticAnalysis/Bisection.py
diff --git a/Intersection.py b/ArithmeticAnalysis/Intersection.py
similarity index 100%
rename from Intersection.py
rename to ArithmeticAnalysis/Intersection.py
diff --git a/ArithmeticAnalysis/LUdecomposition.py b/ArithmeticAnalysis/LUdecomposition.py
new file mode 100644
index 000000000000..bb0827bb39b1
--- /dev/null
+++ b/ArithmeticAnalysis/LUdecomposition.py
@@ -0,0 +1,34 @@
+import math
+import numpy
+
+def LUDecompose (table): #table that contains our data
+    #table has to be a square array so we need to check first
+    rows,columns=numpy.shape(table)
+    L=numpy.zeros((rows,columns))
+    U=numpy.zeros((rows,columns))
+    if rows!=columns:
+        return
+    for i in range (columns):
+        for j in range(i-1):
+            sum=0
+            for k in range (j-1):
+                sum+=L[i][k]*U[k][j]
+            L[i][j]=(table[i][j]-sum)/U[j][j]
+        L[i][i]=1
+        for j in range(i-1,columns):
+            sum1=0
+            for k in range(i-1):
+                sum1+=L[i][k]*U[k][j]
+            U[i][j]=table[i][j]-sum1
+    return L,U
+
+
+
+
+
+
+
+matrix =numpy.array([[2,-2,1],[0,1,2],[5,3,1]])
+L,U = LUDecompose(matrix)
+print(L)
+print(U)
\ No newline at end of file
diff --git a/NeutonMethod.py b/ArithmeticAnalysis/NewtonMethod.py
similarity index 100%
rename from NeutonMethod.py
rename to ArithmeticAnalysis/NewtonMethod.py
diff --git a/ArithmeticAnalysis/NewtonRaphsonMethod.py b/ArithmeticAnalysis/NewtonRaphsonMethod.py
new file mode 100644
index 000000000000..40501134e28a
--- /dev/null
+++ b/ArithmeticAnalysis/NewtonRaphsonMethod.py
@@ -0,0 +1,38 @@
+# Implementing Newton Raphson method in python
+# Author: Haseeb
+
+from sympy import diff
+from decimal import Decimal
+from math import sin, cos, exp
+
+def NewtonRaphson(func, a):
+    ''' Finds root from the point 'a' onwards by Newton-Raphson method '''
+    while True:
+        x = a
+        c = Decimal(a) - ( Decimal(eval(func)) / Decimal(eval(str(diff(func)))) )
+        
+        x = c
+        a = c
+        # This number dictates the accuracy of the answer
+        if  abs(eval(func)) < 10**-15:
+            return  c
+    
+
+# Let's Execute
+if __name__ == '__main__':
+    # Find root of trignometric fucntion
+    # Find value of  pi
+    print ('sin(x) = 0', NewtonRaphson('sin(x)', 2))
+    
+    # Find root of polynomial
+    print ('x**2 - 5*x +2 = 0', NewtonRaphson('x**2 - 5*x +2', 0.4))
+    
+    # Find Square Root of 5
+    print ('x**2 - 5 = 0', NewtonRaphson('x**2 - 5', 0.1))
+
+    #  Exponential Roots
+    print ('exp(x) - 1 = 0', NewtonRaphson('exp(x) - 1', 0))
+    
+    
+    
+
diff --git a/File_Transfer_Protocol/ftp_client_server.py b/File_Transfer_Protocol/ftp_client_server.py
index ff7a8ec2edf1..f73f858431f3 100644
--- a/File_Transfer_Protocol/ftp_client_server.py
+++ b/File_Transfer_Protocol/ftp_client_server.py
@@ -8,21 +8,21 @@
 s.bind((host, port))            # Bind to the port
 s.listen(5)                     # Now wait for client connection.
 
-print 'Server listening....'
+print('Server listening....')
 
 while True:
     conn, addr = s.accept()     # Establish connection with client.
-    print 'Got connection from', addr
+    print('Got connection from', addr)
     data = conn.recv(1024)
     print('Server received', repr(data))
 
-    filename='mytext.txt'
-    f = open(filename,'rb')
-    l = f.read(1024)
-    while (l):
-       conn.send(l)
-       print('Sent ',repr(l))
-       l = f.read(1024)
+    filename = 'mytext.txt'
+    f = open(filename, 'rb')
+    in_data = f.read(1024)
+    while (in_data):
+       conn.send(in_data)
+       print('Sent ', repr(in_data))
+       in_data = f.read(1024)
     f.close()
 
     print('Done sending')
@@ -42,7 +42,7 @@
 s.send("Hello server!")
 
 with open('received_file', 'wb') as f:
-    print 'file opened'
+    print('file opened')
     while True:
         print('receiving data...')
         data = s.recv(1024)
@@ -55,4 +55,4 @@
 f.close()
 print('Successfully get the file')
 s.close()
-print('connection closed')
\ No newline at end of file
+print('connection closed')
diff --git a/Maths/SimpsonRule.py b/Maths/SimpsonRule.py
new file mode 100644
index 000000000000..091c86c17f1b
--- /dev/null
+++ b/Maths/SimpsonRule.py
@@ -0,0 +1,49 @@
+
+'''
+Numerical integration or quadrature for a smooth function f with known values at x_i
+
+This method is the classical approch of suming 'Equally Spaced Abscissas' 
+
+method 2: 
+"Simpson Rule"
+
+'''
+from __future__ import print_function
+
+
+def method_2(boundary, steps):
+# "Simpson Rule"
+# int(f) = delta_x/2 * (b-a)/3*(f1 + 4f2 + 2f_3 + ... + fn)
+	h = (boundary[1] - boundary[0]) / steps
+	a = boundary[0]
+	b = boundary[1]
+	x_i = makePoints(a,b,h)
+	y = 0.0
+	y += (h/3.0)*f(a)
+	cnt = 2
+	for i in x_i:
+		y += (h/3)*(4-2*(cnt%2))*f(i)	
+		cnt += 1
+	y += (h/3.0)*f(b)
+	return y
+
+def makePoints(a,b,h):
+	x = a + h
+	while x < (b-h):
+		yield x
+		x = x + h
+
+def f(x): #enter your function here
+	y = (x-0)*(x-0)
+	return y
+
+def main():
+	a = 0.0 #Lower bound of integration
+	b = 1.0	#Upper bound of integration
+	steps = 10.0		#define number of steps or resolution
+	boundary = [a, b]	#define boundary of integration
+	y = method_2(boundary, steps)
+	print('y = {0}'.format(y))
+
+if __name__ == '__main__':
+        main()
diff --git a/Maths/TrapezoidalRule.py b/Maths/TrapezoidalRule.py
new file mode 100644
index 000000000000..52310c1ed3b0
--- /dev/null
+++ b/Maths/TrapezoidalRule.py
@@ -0,0 +1,46 @@
+'''
+Numerical integration or quadrature for a smooth function f with known values at x_i
+
+This method is the classical approch of suming 'Equally Spaced Abscissas' 
+
+method 1: 
+"extended trapezoidal rule"
+
+'''
+from __future__ import print_function
+
+def method_1(boundary, steps):
+# "extended trapezoidal rule"
+# int(f) = dx/2 * (f1 + 2f2 + ... + fn)
+	h = (boundary[1] - boundary[0]) / steps
+	a = boundary[0]
+	b = boundary[1]
+	x_i = makePoints(a,b,h)
+	y = 0.0	
+	y += (h/2.0)*f(a)
+	for i in x_i:
+		#print(i)	
+		y += h*f(i)
+	y += (h/2.0)*f(b)	
+	return y	
+
+def makePoints(a,b,h):
+	x = a + h	
+	while x < (b-h):
+		yield x
+		x = x + h
+		
+def f(x): #enter your function here
+	y = (x-0)*(x-0)
+	return y
+
+def main():
+	a = 0.0 #Lower bound of integration
+	b = 1.0	#Upper bound of integration
+	steps = 10.0		#define number of steps or resolution	
+	boundary = [a, b]	#define boundary of integration
+	y = method_1(boundary, steps)
+	print('y = {0}'.format(y))
+
+if __name__ == '__main__':
+	main()
diff --git a/Project Euler/Problem 01/sol2.py b/Project Euler/Problem 01/sol2.py
index d330387e98ab..2b7760e0bfff 100644
--- a/Project Euler/Problem 01/sol2.py	
+++ b/Project Euler/Problem 01/sol2.py	
@@ -11,10 +11,10 @@
     raw_input = input  # Python 3
 n = int(raw_input().strip())
 sum = 0
-terms = (n-1)/3
-sum+= ((terms)*(6+(terms-1)*3))/2 #sum of an A.P.
-terms = (n-1)/5
-sum+= ((terms)*(10+(terms-1)*5))/2
-terms = (n-1)/15
-sum-= ((terms)*(30+(terms-1)*15))/2
+terms = (n-1)//3
+sum+= ((terms)*(6+(terms-1)*3))//2 #sum of an A.P.
+terms = (n-1)//5
+sum+= ((terms)*(10+(terms-1)*5))//2
+terms = (n-1)//15
+sum-= ((terms)*(30+(terms-1)*15))//2
 print(sum)
diff --git a/Project Euler/Problem 01/sol3.py b/Project Euler/Problem 01/sol3.py
index 78b4d0e93519..f4f3aefcc5de 100644
--- a/Project Euler/Problem 01/sol3.py	
+++ b/Project Euler/Problem 01/sol3.py	
@@ -1,3 +1,5 @@
+from __future__ import print_function
+
 '''
 Problem Statement:
 If we list all the natural numbers below 10 that are multiples of 3 or 5,
@@ -7,7 +9,7 @@
 '''
 This solution is based on the pattern that the successive numbers in the series follow: 0+3,+2,+1,+3,+1,+2,+3.
 '''
-from __future__ import print_function
+
 try:
     raw_input          # Python 2
 except NameError:
diff --git a/Project Euler/Problem 01/sol4.py b/Project Euler/Problem 01/sol4.py
new file mode 100644
index 000000000000..7941f5fcd3fe
--- /dev/null
+++ b/Project Euler/Problem 01/sol4.py	
@@ -0,0 +1,30 @@
+def mulitples(limit):
+    xmulti = []
+    zmulti = []
+    z = 3
+    x = 5
+    temp = 1
+    while True:
+        result = z * temp
+        if (result < limit):
+            zmulti.append(result)
+            temp += 1
+        else:
+            temp = 1
+            break
+    while True:
+        result = x * temp
+        if (result < limit):
+            xmulti.append(result)
+            temp += 1
+        else:
+            break
+    collection = list(set(xmulti+zmulti))
+    return (sum(collection))
+    
+    
+        
+        
+        
+    
+print (mulitples(1000))
diff --git a/Project Euler/Problem 02/sol2.py b/Project Euler/Problem 02/sol2.py
new file mode 100644
index 000000000000..9bbd0c535d63
--- /dev/null
+++ b/Project Euler/Problem 02/sol2.py	
@@ -0,0 +1,12 @@
+def fib(n):
+    a, b, s = 0, 1, 0
+    while b < n:
+        if b % 2 == 0 and b < n: s += b
+        a, b = b, a+b
+    ls.append(s)
+
+T = int(input().strip())
+ls = []
+for _ in range(T):
+    fib(int(input().strip()))
+print(*ls, sep = '\n')
diff --git a/Project Euler/Problem 02/sol3.py b/Project Euler/Problem 02/sol3.py
new file mode 100644
index 000000000000..d36b741bb4f9
--- /dev/null
+++ b/Project Euler/Problem 02/sol3.py	
@@ -0,0 +1,20 @@
+'''
+Problem:
+Each new term in the Fibonacci sequence is generated by adding the previous two terms. 
+                0,1,1,2,3,5,8,13,21,34,55,89,..
+Every third term from 0 is even So using this I have written a simple code
+By considering the terms in the Fibonacci sequence whose values do not exceed n, find the sum of the even-valued terms.
+e.g. for n=10, we have {2,8}, sum is 10.
+'''
+"""Python 3"""
+n = int(input())
+a=0
+b=2
+count=0
+while 4*b+a<n:
+    c=4*b+a
+    a=b
+    b=c
+    count=count+a
+print(count+b)
+   
diff --git a/Project Euler/Problem 05/sol2.py b/Project Euler/Problem 05/sol2.py
new file mode 100644
index 000000000000..cd11437f30db
--- /dev/null
+++ b/Project Euler/Problem 05/sol2.py	
@@ -0,0 +1,20 @@
+#!/bin/python3
+'''
+Problem:
+2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.
+What is the smallest positive number that is evenly divisible(divisible with no remainder) by all of the numbers from 1 to N?
+'''
+
+""" Euclidean GCD Algorithm """
+def gcd(x,y):
+    return x if y==0 else gcd(y,x%y)
+
+""" Using the property lcm*gcd of two numbers = product of them """
+def lcm(x,y):
+    return (x*y)//gcd(x,y)
+
+n = int(input())
+g=1
+for i in range(1,n+1):
+    g=lcm(g,i)
+print(g)
diff --git a/Project Euler/Problem 08/sol1.py b/Project Euler/Problem 08/sol1.py
new file mode 100644
index 000000000000..fb5ed25bfe93
--- /dev/null
+++ b/Project Euler/Problem 08/sol1.py	
@@ -0,0 +1,15 @@
+import sys
+def main():
+    LargestProduct = -sys.maxsize-1
+    number=input().strip()
+    for i in range(len(number)-13):
+        product=1
+        for j in range(13):
+            product *= int(number[i+j])
+        if product > LargestProduct:
+            LargestProduct = product
+    print(LargestProduct)
+
+
+if __name__ == '__main__':
+    main()
diff --git a/Project Euler/Problem 10/sol1.py b/Project Euler/Problem 10/sol1.py
new file mode 100644
index 000000000000..94e5b7362114
--- /dev/null
+++ b/Project Euler/Problem 10/sol1.py	
@@ -0,0 +1,38 @@
+from __future__ import print_function
+from math import sqrt
+
+try:
+	xrange			#Python 2
+except NameError:
+	xrange = range	#Python 3
+
+def is_prime(n):
+	for i in xrange(2, int(sqrt(n))+1):
+		if n%i == 0:
+			return False
+
+	return True
+
+def sum_of_primes(n):
+	if n > 2:
+		sumOfPrimes = 2
+	else:
+		return 0
+
+	for i in xrange(3, n, 2):
+		if is_prime(i):
+			sumOfPrimes += i
+
+	return sumOfPrimes
+
+if __name__ == '__main__':
+	import sys
+
+	if len(sys.argv) == 1:
+		print(sum_of_primes(2000000))
+	else:
+		try:
+			n = int(sys.argv[1])
+			print(sum_of_primes(n))
+		except ValueError:
+			print('Invalid entry - please enter a number.')
diff --git a/Project Euler/Problem 11/grid.txt b/Project Euler/Problem 11/grid.txt
new file mode 100644
index 000000000000..1fc75c66a314
--- /dev/null
+++ b/Project Euler/Problem 11/grid.txt	
@@ -0,0 +1,20 @@
+08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
+49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
+81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
+52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
+22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
+24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
+32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
+67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
+24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
+21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
+78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92
+16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
+86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58
+19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40
+04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66
+88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69
+04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36
+20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16
+20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54
+01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48
\ No newline at end of file
diff --git a/Project Euler/Problem 11/sol1.py b/Project Euler/Problem 11/sol1.py
new file mode 100644
index 000000000000..b882dc449156
--- /dev/null
+++ b/Project Euler/Problem 11/sol1.py	
@@ -0,0 +1,68 @@
+from __future__ import print_function
+'''
+What is the greatest product of four adjacent numbers (horizontally, vertically, or diagonally) in this 20x20 array?
+
+08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
+49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
+81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
+52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
+22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
+24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
+32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
+67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
+24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
+21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
+78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92
+16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
+86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58
+19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40
+04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66
+88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69
+04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36
+20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16
+20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54
+01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48
+'''
+
+try:
+	xrange			#Python 2
+except NameError:
+	xrange = range	#Python 2
+
+def largest_product(grid):
+	nColumns = len(grid[0])
+	nRows = len(grid)
+
+	largest = 0
+	lrDiagProduct = 0
+	rlDiagProduct = 0
+
+	#Check vertically, horizontally, diagonally at the same time (only works for nxn grid)
+	for i in xrange(nColumns):
+		for j in xrange(nRows-3):
+			vertProduct = grid[j][i]*grid[j+1][i]*grid[j+2][i]*grid[j+3][i]
+			horzProduct = grid[i][j]*grid[i][j+1]*grid[i][j+2]*grid[i][j+3]
+
+			#Left-to-right diagonal (\) product
+			if (i < nColumns-3):
+				lrDiagProduct = grid[i][j]*grid[i+1][j+1]*grid[i+2][j+2]*grid[i+3][j+3]
+
+			#Right-to-left diagonal(/) product
+			if (i > 2):
+				rlDiagProduct = grid[i][j]*grid[i-1][j+1]*grid[i-2][j+2]*grid[i-3][j+3]
+
+			maxProduct = max(vertProduct, horzProduct, lrDiagProduct, rlDiagProduct)
+			if maxProduct > largest:
+				largest = maxProduct
+
+	return largest
+
+if __name__ == '__main__':
+	grid = []
+	with open('grid.txt') as file:
+		for line in file:
+			grid.append(line.strip('\n').split(' '))
+
+	grid = [[int(i) for i in grid[j]] for j in xrange(len(grid))]
+
+	print(largest_product(grid))
\ No newline at end of file
diff --git a/Project Euler/Problem 11/sol2.py b/Project Euler/Problem 11/sol2.py
new file mode 100644
index 000000000000..b03395f01697
--- /dev/null
+++ b/Project Euler/Problem 11/sol2.py	
@@ -0,0 +1,39 @@
+def main():
+	with open ("grid.txt", "r") as f:
+		l = []
+		for i in range(20):
+			l.append([int(x) for x in f.readline().split()])
+
+		maximum = 0
+
+		# right
+		for i in range(20):
+			for j in range(17):
+				temp = l[i][j] * l[i][j+1] * l[i][j+2] * l[i][j+3]
+				if temp > maximum:
+					maximum = temp
+
+		# down 
+		for i in range(17):
+			for j in range(20):
+				temp = l[i][j] * l[i+1][j] * l[i+2][j] * l[i+3][j]
+				if temp > maximum:
+					maximum = temp
+
+		#diagonal 1
+		for i in range(17):
+			for j in range(17):
+				temp = l[i][j] * l[i+1][j+1] * l[i+2][j+2] * l[i+3][j+3]
+				if temp > maximum:
+					maximum = temp
+				
+		#diagonal 2
+		for i in range(17):
+			for j in range(3, 20):
+				temp = l[i][j] * l[i+1][j-1] * l[i+2][j-2] * l[i+3][j-3]
+				if temp > maximum:
+					maximum = temp
+		print(maximum)
+
+if __name__ == '__main__':
+	main()
\ No newline at end of file
diff --git a/Project Euler/Problem 12/sol1.py b/Project Euler/Problem 12/sol1.py
new file mode 100644
index 000000000000..9c4483fd62e5
--- /dev/null
+++ b/Project Euler/Problem 12/sol1.py	
@@ -0,0 +1,46 @@
+from __future__ import print_function
+from math import sqrt
+'''
+Highly divisible triangular numbers
+Problem 12
+The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be:
+
+1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...
+
+Let us list the factors of the first seven triangle numbers:
+
+ 1: 1
+ 3: 1,3
+ 6: 1,2,3,6
+10: 1,2,5,10
+15: 1,3,5,15
+21: 1,3,7,21
+28: 1,2,4,7,14,28
+We can see that 28 is the first triangle number to have over five divisors.
+
+What is the value of the first triangle number to have over five hundred divisors?
+'''
+try:
+	xrange		#Python 2
+except NameError:
+	xrange = range	#Python 3
+
+def count_divisors(n):
+	nDivisors = 0
+	for i in xrange(1, int(sqrt(n))+1):
+		if n%i == 0:
+			nDivisors += 2
+
+	return nDivisors
+
+tNum = 1
+i = 1
+
+while True:
+	i += 1
+	tNum += i
+
+	if count_divisors(tNum) > 500:
+		break
+
+print(tNum)
\ No newline at end of file
diff --git a/Project Euler/Problem 15/sol1.py b/Project Euler/Problem 15/sol1.py
new file mode 100644
index 000000000000..9b61b37d2081
--- /dev/null
+++ b/Project Euler/Problem 15/sol1.py	
@@ -0,0 +1,20 @@
+from __future__ import print_function
+from math import factorial, ceil
+
+def lattice_paths(n):
+	n = 2*n #middle entry of odd rows starting at row 3 is the solution for n = 1, 2, 3,...
+	k = n/2
+
+	return factorial(n)/(factorial(k)*factorial(n-k))
+
+if __name__ == '__main__':
+	import sys
+
+	if len(sys.argv) == 1:
+		print(lattice_paths(20))
+	else:
+		try:
+			n = int(sys.argv[1])
+			print(lattice_paths(n))
+		except ValueError:
+			print('Invalid entry - please enter a number.')
diff --git a/Project Euler/Problem 17/sol1.py b/Project Euler/Problem 17/sol1.py
new file mode 100644
index 000000000000..9de5d80b9b29
--- /dev/null
+++ b/Project Euler/Problem 17/sol1.py	
@@ -0,0 +1,35 @@
+from __future__ import print_function
+'''
+Number letter counts
+Problem 17
+
+If the numbers 1 to 5 are written out in words: one, two, three, four, five, then there are 3 + 3 + 5 + 4 + 4 = 19 letters used in total.
+
+If all the numbers from 1 to 1000 (one thousand) inclusive were written out in words, how many letters would be used?
+
+
+NOTE: Do not count spaces or hyphens. For example, 342 (three hundred and forty-two) contains 23 letters and 115 (one hundred and fifteen) 
+contains 20 letters. The use of "and" when writing out numbers is in compliance with British usage.
+'''
+
+ones_counts = [0, 3, 3, 5, 4, 4, 3, 5, 5, 4, 3, 6, 6, 8, 8, 7, 7, 9, 8, 8] #number of letters in zero, one, two, ..., nineteen (0 for zero since it's never said aloud)
+tens_counts = [0, 0, 6, 6, 5, 5, 5, 7, 6, 6] #number of letters in twenty, thirty, ..., ninety (0 for numbers less than 20 due to inconsistency in teens)
+
+count = 0
+
+for i in range(1, 1001):
+	if i < 1000:
+		if i >= 100:
+			count += ones_counts[i/100] + 7 #add number of letters for "n hundred"
+
+			if i%100 is not 0:
+				count += 3 #add number of letters for "and" if number is not multiple of 100
+
+		if 0 < i%100 < 20:
+			count += ones_counts[i%100] #add number of letters for one, two, three, ..., nineteen (could be combined with below if not for inconsistency in teens)
+		else:
+			count += ones_counts[i%10] + tens_counts[(i%100-i%10)/10] #add number of letters for twenty, twenty one, ..., ninety nine
+	else:
+		count += ones_counts[i/1000] + 8
+
+print(count)
\ No newline at end of file
diff --git a/Project Euler/Problem 19/sol1.py b/Project Euler/Problem 19/sol1.py
new file mode 100644
index 000000000000..94cf117026a4
--- /dev/null
+++ b/Project Euler/Problem 19/sol1.py	
@@ -0,0 +1,51 @@
+from __future__ import print_function
+'''
+Counting Sundays
+Problem 19
+
+You are given the following information, but you may prefer to do some research for yourself.
+
+1 Jan 1900 was a Monday.
+Thirty days has September,
+April, June and November.
+All the rest have thirty-one,
+Saving February alone,
+Which has twenty-eight, rain or shine.
+And on leap years, twenty-nine.
+
+A leap year occurs on any year evenly divisible by 4, but not on a century unless it is divisible by 400.
+
+How many Sundays fell on the first of the month during the twentieth century (1 Jan 1901 to 31 Dec 2000)?
+'''
+
+days_per_month = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]
+
+day = 6
+month = 1
+year = 1901
+
+sundays = 0
+
+while year < 2001:
+	day += 7
+
+	if (year%4 == 0 and not year%100 == 0) or (year%400 == 0):
+		if day > days_per_month[month-1] and month is not 2:
+			month += 1
+			day = day-days_per_month[month-2]
+		elif day > 29 and month is 2:
+			month += 1
+			day = day-29
+	else:
+		if day > days_per_month[month-1]:
+			month += 1
+			day = day-days_per_month[month-2]
+	
+	if month > 12:
+		year += 1
+		month = 1
+
+	if year < 2001 and day is 1:
+		sundays += 1
+
+print(sundays)
\ No newline at end of file
diff --git a/Project Euler/Problem 20/sol2.py b/Project Euler/Problem 20/sol2.py
new file mode 100644
index 000000000000..bca9af9cb9ef
--- /dev/null
+++ b/Project Euler/Problem 20/sol2.py	
@@ -0,0 +1,5 @@
+from math import factorial
+def main():
+	print(sum([int(x) for x in str(factorial(100))]))
+if __name__ == '__main__':
+	main()
\ No newline at end of file
diff --git a/Project Euler/Problem 21/sol1.py b/Project Euler/Problem 21/sol1.py
new file mode 100644
index 000000000000..6d137a7d4332
--- /dev/null
+++ b/Project Euler/Problem 21/sol1.py	
@@ -0,0 +1,42 @@
+#-.- coding: latin-1 -.-
+from __future__ import print_function
+from math import sqrt
+'''
+Amicable Numbers
+Problem 21
+
+Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n).
+If d(a) = b and d(b) = a, where a ≠ b, then a and b are an amicable pair and each of a and b are called amicable numbers.
+
+For example, the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110; therefore d(220) = 284. The proper divisors of 284 are 1, 2, 4, 71 and 142; so d(284) = 220.
+
+Evaluate the sum of all the amicable numbers under 10000.
+'''
+try:
+	xrange		#Python 2
+except NameError:
+	xrange = range	#Python 3
+
+def sum_of_divisors(n):
+	total = 0
+	for i in xrange(1, int(sqrt(n)+1)):
+		if n%i == 0 and i != sqrt(n):
+			total += i + n//i
+		elif i == sqrt(n):
+			total += i
+
+	return total-n
+
+sums = []
+total = 0
+
+for i in xrange(1, 10000):
+	n = sum_of_divisors(i)
+	
+	if n < len(sums):
+		if sums[n-1] == i:
+			total += n + i
+
+	sums.append(n)
+
+print(total)
\ No newline at end of file
diff --git a/Project Euler/Problem 22/p022_names.txt b/Project Euler/Problem 22/p022_names.txt
new file mode 100644
index 000000000000..7b8986bf6ce9
--- /dev/null
+++ b/Project Euler/Problem 22/p022_names.txt	
@@ -0,0 +1 @@
+"MARY","PATRICIA","LINDA","BARBARA","ELIZABETH","JENNIFER","MARIA","SUSAN","MARGARET","DOROTHY","LISA","NANCY","KAREN","BETTY","HELEN","SANDRA","DONNA","CAROL","RUTH","SHARON","MICHELLE","LAURA","SARAH","KIMBERLY","DEBORAH","JESSICA","SHIRLEY","CYNTHIA","ANGELA","MELISSA","BRENDA","AMY","ANNA","REBECCA","VIRGINIA","KATHLEEN","PAMELA","MARTHA","DEBRA","AMANDA","STEPHANIE","CAROLYN","CHRISTINE","MARIE","JANET","CATHERINE","FRANCES","ANN","JOYCE","DIANE","ALICE","JULIE","HEATHER","TERESA","DORIS","GLORIA","EVELYN","JEAN","CHERYL","MILDRED","KATHERINE","JOAN","ASHLEY","JUDITH","ROSE","JANICE","KELLY","NICOLE","JUDY","CHRISTINA","KATHY","THERESA","BEVERLY","DENISE","TAMMY","IRENE","JANE","LORI","RACHEL","MARILYN","ANDREA","KATHRYN","LOUISE","SARA","ANNE","JACQUELINE","WANDA","BONNIE","JULIA","RUBY","LOIS","TINA","PHYLLIS","NORMA","PAULA","DIANA","ANNIE","LILLIAN","EMILY","ROBIN","PEGGY","CRYSTAL","GLADYS","RITA","DAWN","CONNIE","FLORENCE","TRACY","EDNA","TIFFANY","CARMEN","ROSA","CINDY","GRACE","WENDY","VICTORIA","EDITH","KIM","SHERRY","SYLVIA","JOSEPHINE","THELMA","SHANNON","SHEILA","ETHEL","ELLEN","ELAINE","MARJORIE","CARRIE","CHARLOTTE","MONICA","ESTHER","PAULINE","EMMA","JUANITA","ANITA","RHONDA","HAZEL","AMBER","EVA","DEBBIE","APRIL","LESLIE","CLARA","LUCILLE","JAMIE","JOANNE","ELEANOR","VALERIE","DANIELLE","MEGAN","ALICIA","SUZANNE","MICHELE","GAIL","BERTHA","DARLENE","VERONICA","JILL","ERIN","GERALDINE","LAUREN","CATHY","JOANN","LORRAINE","LYNN","SALLY","REGINA","ERICA","BEATRICE","DOLORES","BERNICE","AUDREY","YVONNE","ANNETTE","JUNE","SAMANTHA","MARION","DANA","STACY","ANA","RENEE","IDA","VIVIAN","ROBERTA","HOLLY","BRITTANY","MELANIE","LORETTA","YOLANDA","JEANETTE","LAURIE","KATIE","KRISTEN","VANESSA","ALMA","SUE","ELSIE","BETH","JEANNE","VICKI","CARLA","TARA","ROSEMARY","EILEEN","TERRI","GERTRUDE","LUCY","TONYA","ELLA","STACEY","WILMA","GINA","KRISTIN","JESSIE","NATALIE","AGNES","VERA","WILLIE","CHARLENE","BESSIE","DELORES","MELINDA","PEARL","ARLENE","MAUREEN","COLLEEN","ALLISON","TAMARA","JOY","GEORGIA","CONSTANCE","LILLIE","CLAUDIA","JACKIE","MARCIA","TANYA","NELLIE","MINNIE","MARLENE","HEIDI","GLENDA","LYDIA","VIOLA","COURTNEY","MARIAN","STELLA","CAROLINE","DORA","JO","VICKIE","MATTIE","TERRY","MAXINE","IRMA","MABEL","MARSHA","MYRTLE","LENA","CHRISTY","DEANNA","PATSY","HILDA","GWENDOLYN","JENNIE","NORA","MARGIE","NINA","CASSANDRA","LEAH","PENNY","KAY","PRISCILLA","NAOMI","CAROLE","BRANDY","OLGA","BILLIE","DIANNE","TRACEY","LEONA","JENNY","FELICIA","SONIA","MIRIAM","VELMA","BECKY","BOBBIE","VIOLET","KRISTINA","TONI","MISTY","MAE","SHELLY","DAISY","RAMONA","SHERRI","ERIKA","KATRINA","CLAIRE","LINDSEY","LINDSAY","GENEVA","GUADALUPE","BELINDA","MARGARITA","SHERYL","CORA","FAYE","ADA","NATASHA","SABRINA","ISABEL","MARGUERITE","HATTIE","HARRIET","MOLLY","CECILIA","KRISTI","BRANDI","BLANCHE","SANDY","ROSIE","JOANNA","IRIS","EUNICE","ANGIE","INEZ","LYNDA","MADELINE","AMELIA","ALBERTA","GENEVIEVE","MONIQUE","JODI","JANIE","MAGGIE","KAYLA","SONYA","JAN","LEE","KRISTINE","CANDACE","FANNIE","MARYANN","OPAL","ALISON","YVETTE","MELODY","LUZ","SUSIE","OLIVIA","FLORA","SHELLEY","KRISTY","MAMIE","LULA","LOLA","VERNA","BEULAH","ANTOINETTE","CANDICE","JUANA","JEANNETTE","PAM","KELLI","HANNAH","WHITNEY","BRIDGET","KARLA","CELIA","LATOYA","PATTY","SHELIA","GAYLE","DELLA","VICKY","LYNNE","SHERI","MARIANNE","KARA","JACQUELYN","ERMA","BLANCA","MYRA","LETICIA","PAT","KRISTA","ROXANNE","ANGELICA","JOHNNIE","ROBYN","FRANCIS","ADRIENNE","ROSALIE","ALEXANDRA","BROOKE","BETHANY","SADIE","BERNADETTE","TRACI","JODY","KENDRA","JASMINE","NICHOLE","RACHAEL","CHELSEA","MABLE","ERNESTINE","MURIEL","MARCELLA","ELENA","KRYSTAL","ANGELINA","NADINE","KARI","ESTELLE","DIANNA","PAULETTE","LORA","MONA","DOREEN","ROSEMARIE","ANGEL","DESIREE","ANTONIA","HOPE","GINGER","JANIS","BETSY","CHRISTIE","FREDA","MERCEDES","MEREDITH","LYNETTE","TERI","CRISTINA","EULA","LEIGH","MEGHAN","SOPHIA","ELOISE","ROCHELLE","GRETCHEN","CECELIA","RAQUEL","HENRIETTA","ALYSSA","JANA","KELLEY","GWEN","KERRY","JENNA","TRICIA","LAVERNE","OLIVE","ALEXIS","TASHA","SILVIA","ELVIRA","CASEY","DELIA","SOPHIE","KATE","PATTI","LORENA","KELLIE","SONJA","LILA","LANA","DARLA","MAY","MINDY","ESSIE","MANDY","LORENE","ELSA","JOSEFINA","JEANNIE","MIRANDA","DIXIE","LUCIA","MARTA","FAITH","LELA","JOHANNA","SHARI","CAMILLE","TAMI","SHAWNA","ELISA","EBONY","MELBA","ORA","NETTIE","TABITHA","OLLIE","JAIME","WINIFRED","KRISTIE","MARINA","ALISHA","AIMEE","RENA","MYRNA","MARLA","TAMMIE","LATASHA","BONITA","PATRICE","RONDA","SHERRIE","ADDIE","FRANCINE","DELORIS","STACIE","ADRIANA","CHERI","SHELBY","ABIGAIL","CELESTE","JEWEL","CARA","ADELE","REBEKAH","LUCINDA","DORTHY","CHRIS","EFFIE","TRINA","REBA","SHAWN","SALLIE","AURORA","LENORA","ETTA","LOTTIE","KERRI","TRISHA","NIKKI","ESTELLA","FRANCISCA","JOSIE","TRACIE","MARISSA","KARIN","BRITTNEY","JANELLE","LOURDES","LAUREL","HELENE","FERN","ELVA","CORINNE","KELSEY","INA","BETTIE","ELISABETH","AIDA","CAITLIN","INGRID","IVA","EUGENIA","CHRISTA","GOLDIE","CASSIE","MAUDE","JENIFER","THERESE","FRANKIE","DENA","LORNA","JANETTE","LATONYA","CANDY","MORGAN","CONSUELO","TAMIKA","ROSETTA","DEBORA","CHERIE","POLLY","DINA","JEWELL","FAY","JILLIAN","DOROTHEA","NELL","TRUDY","ESPERANZA","PATRICA","KIMBERLEY","SHANNA","HELENA","CAROLINA","CLEO","STEFANIE","ROSARIO","OLA","JANINE","MOLLIE","LUPE","ALISA","LOU","MARIBEL","SUSANNE","BETTE","SUSANA","ELISE","CECILE","ISABELLE","LESLEY","JOCELYN","PAIGE","JONI","RACHELLE","LEOLA","DAPHNE","ALTA","ESTER","PETRA","GRACIELA","IMOGENE","JOLENE","KEISHA","LACEY","GLENNA","GABRIELA","KERI","URSULA","LIZZIE","KIRSTEN","SHANA","ADELINE","MAYRA","JAYNE","JACLYN","GRACIE","SONDRA","CARMELA","MARISA","ROSALIND","CHARITY","TONIA","BEATRIZ","MARISOL","CLARICE","JEANINE","SHEENA","ANGELINE","FRIEDA","LILY","ROBBIE","SHAUNA","MILLIE","CLAUDETTE","CATHLEEN","ANGELIA","GABRIELLE","AUTUMN","KATHARINE","SUMMER","JODIE","STACI","LEA","CHRISTI","JIMMIE","JUSTINE","ELMA","LUELLA","MARGRET","DOMINIQUE","SOCORRO","RENE","MARTINA","MARGO","MAVIS","CALLIE","BOBBI","MARITZA","LUCILE","LEANNE","JEANNINE","DEANA","AILEEN","LORIE","LADONNA","WILLA","MANUELA","GALE","SELMA","DOLLY","SYBIL","ABBY","LARA","DALE","IVY","DEE","WINNIE","MARCY","LUISA","JERI","MAGDALENA","OFELIA","MEAGAN","AUDRA","MATILDA","LEILA","CORNELIA","BIANCA","SIMONE","BETTYE","RANDI","VIRGIE","LATISHA","BARBRA","GEORGINA","ELIZA","LEANN","BRIDGETTE","RHODA","HALEY","ADELA","NOLA","BERNADINE","FLOSSIE","ILA","GRETA","RUTHIE","NELDA","MINERVA","LILLY","TERRIE","LETHA","HILARY","ESTELA","VALARIE","BRIANNA","ROSALYN","EARLINE","CATALINA","AVA","MIA","CLARISSA","LIDIA","CORRINE","ALEXANDRIA","CONCEPCION","TIA","SHARRON","RAE","DONA","ERICKA","JAMI","ELNORA","CHANDRA","LENORE","NEVA","MARYLOU","MELISA","TABATHA","SERENA","AVIS","ALLIE","SOFIA","JEANIE","ODESSA","NANNIE","HARRIETT","LORAINE","PENELOPE","MILAGROS","EMILIA","BENITA","ALLYSON","ASHLEE","TANIA","TOMMIE","ESMERALDA","KARINA","EVE","PEARLIE","ZELMA","MALINDA","NOREEN","TAMEKA","SAUNDRA","HILLARY","AMIE","ALTHEA","ROSALINDA","JORDAN","LILIA","ALANA","GAY","CLARE","ALEJANDRA","ELINOR","MICHAEL","LORRIE","JERRI","DARCY","EARNESTINE","CARMELLA","TAYLOR","NOEMI","MARCIE","LIZA","ANNABELLE","LOUISA","EARLENE","MALLORY","CARLENE","NITA","SELENA","TANISHA","KATY","JULIANNE","JOHN","LAKISHA","EDWINA","MARICELA","MARGERY","KENYA","DOLLIE","ROXIE","ROSLYN","KATHRINE","NANETTE","CHARMAINE","LAVONNE","ILENE","KRIS","TAMMI","SUZETTE","CORINE","KAYE","JERRY","MERLE","CHRYSTAL","LINA","DEANNE","LILIAN","JULIANA","ALINE","LUANN","KASEY","MARYANNE","EVANGELINE","COLETTE","MELVA","LAWANDA","YESENIA","NADIA","MADGE","KATHIE","EDDIE","OPHELIA","VALERIA","NONA","MITZI","MARI","GEORGETTE","CLAUDINE","FRAN","ALISSA","ROSEANN","LAKEISHA","SUSANNA","REVA","DEIDRE","CHASITY","SHEREE","CARLY","JAMES","ELVIA","ALYCE","DEIRDRE","GENA","BRIANA","ARACELI","KATELYN","ROSANNE","WENDI","TESSA","BERTA","MARVA","IMELDA","MARIETTA","MARCI","LEONOR","ARLINE","SASHA","MADELYN","JANNA","JULIETTE","DEENA","AURELIA","JOSEFA","AUGUSTA","LILIANA","YOUNG","CHRISTIAN","LESSIE","AMALIA","SAVANNAH","ANASTASIA","VILMA","NATALIA","ROSELLA","LYNNETTE","CORINA","ALFREDA","LEANNA","CAREY","AMPARO","COLEEN","TAMRA","AISHA","WILDA","KARYN","CHERRY","QUEEN","MAURA","MAI","EVANGELINA","ROSANNA","HALLIE","ERNA","ENID","MARIANA","LACY","JULIET","JACKLYN","FREIDA","MADELEINE","MARA","HESTER","CATHRYN","LELIA","CASANDRA","BRIDGETT","ANGELITA","JANNIE","DIONNE","ANNMARIE","KATINA","BERYL","PHOEBE","MILLICENT","KATHERYN","DIANN","CARISSA","MARYELLEN","LIZ","LAURI","HELGA","GILDA","ADRIAN","RHEA","MARQUITA","HOLLIE","TISHA","TAMERA","ANGELIQUE","FRANCESCA","BRITNEY","KAITLIN","LOLITA","FLORINE","ROWENA","REYNA","TWILA","FANNY","JANELL","INES","CONCETTA","BERTIE","ALBA","BRIGITTE","ALYSON","VONDA","PANSY","ELBA","NOELLE","LETITIA","KITTY","DEANN","BRANDIE","LOUELLA","LETA","FELECIA","SHARLENE","LESA","BEVERLEY","ROBERT","ISABELLA","HERMINIA","TERRA","CELINA","TORI","OCTAVIA","JADE","DENICE","GERMAINE","SIERRA","MICHELL","CORTNEY","NELLY","DORETHA","SYDNEY","DEIDRA","MONIKA","LASHONDA","JUDI","CHELSEY","ANTIONETTE","MARGOT","BOBBY","ADELAIDE","NAN","LEEANN","ELISHA","DESSIE","LIBBY","KATHI","GAYLA","LATANYA","MINA","MELLISA","KIMBERLEE","JASMIN","RENAE","ZELDA","ELDA","MA","JUSTINA","GUSSIE","EMILIE","CAMILLA","ABBIE","ROCIO","KAITLYN","JESSE","EDYTHE","ASHLEIGH","SELINA","LAKESHA","GERI","ALLENE","PAMALA","MICHAELA","DAYNA","CARYN","ROSALIA","SUN","JACQULINE","REBECA","MARYBETH","KRYSTLE","IOLA","DOTTIE","BENNIE","BELLE","AUBREY","GRISELDA","ERNESTINA","ELIDA","ADRIANNE","DEMETRIA","DELMA","CHONG","JAQUELINE","DESTINY","ARLEEN","VIRGINA","RETHA","FATIMA","TILLIE","ELEANORE","CARI","TREVA","BIRDIE","WILHELMINA","ROSALEE","MAURINE","LATRICE","YONG","JENA","TARYN","ELIA","DEBBY","MAUDIE","JEANNA","DELILAH","CATRINA","SHONDA","HORTENCIA","THEODORA","TERESITA","ROBBIN","DANETTE","MARYJANE","FREDDIE","DELPHINE","BRIANNE","NILDA","DANNA","CINDI","BESS","IONA","HANNA","ARIEL","WINONA","VIDA","ROSITA","MARIANNA","WILLIAM","RACHEAL","GUILLERMINA","ELOISA","CELESTINE","CAREN","MALISSA","LONA","CHANTEL","SHELLIE","MARISELA","LEORA","AGATHA","SOLEDAD","MIGDALIA","IVETTE","CHRISTEN","ATHENA","JANEL","CHLOE","VEDA","PATTIE","TESSIE","TERA","MARILYNN","LUCRETIA","KARRIE","DINAH","DANIELA","ALECIA","ADELINA","VERNICE","SHIELA","PORTIA","MERRY","LASHAWN","DEVON","DARA","TAWANA","OMA","VERDA","CHRISTIN","ALENE","ZELLA","SANDI","RAFAELA","MAYA","KIRA","CANDIDA","ALVINA","SUZAN","SHAYLA","LYN","LETTIE","ALVA","SAMATHA","ORALIA","MATILDE","MADONNA","LARISSA","VESTA","RENITA","INDIA","DELOIS","SHANDA","PHILLIS","LORRI","ERLINDA","CRUZ","CATHRINE","BARB","ZOE","ISABELL","IONE","GISELA","CHARLIE","VALENCIA","ROXANNA","MAYME","KISHA","ELLIE","MELLISSA","DORRIS","DALIA","BELLA","ANNETTA","ZOILA","RETA","REINA","LAURETTA","KYLIE","CHRISTAL","PILAR","CHARLA","ELISSA","TIFFANI","TANA","PAULINA","LEOTA","BREANNA","JAYME","CARMEL","VERNELL","TOMASA","MANDI","DOMINGA","SANTA","MELODIE","LURA","ALEXA","TAMELA","RYAN","MIRNA","KERRIE","VENUS","NOEL","FELICITA","CRISTY","CARMELITA","BERNIECE","ANNEMARIE","TIARA","ROSEANNE","MISSY","CORI","ROXANA","PRICILLA","KRISTAL","JUNG","ELYSE","HAYDEE","ALETHA","BETTINA","MARGE","GILLIAN","FILOMENA","CHARLES","ZENAIDA","HARRIETTE","CARIDAD","VADA","UNA","ARETHA","PEARLINE","MARJORY","MARCELA","FLOR","EVETTE","ELOUISE","ALINA","TRINIDAD","DAVID","DAMARIS","CATHARINE","CARROLL","BELVA","NAKIA","MARLENA","LUANNE","LORINE","KARON","DORENE","DANITA","BRENNA","TATIANA","SAMMIE","LOUANN","LOREN","JULIANNA","ANDRIA","PHILOMENA","LUCILA","LEONORA","DOVIE","ROMONA","MIMI","JACQUELIN","GAYE","TONJA","MISTI","JOE","GENE","CHASTITY","STACIA","ROXANN","MICAELA","NIKITA","MEI","VELDA","MARLYS","JOHNNA","AURA","LAVERN","IVONNE","HAYLEY","NICKI","MAJORIE","HERLINDA","GEORGE","ALPHA","YADIRA","PERLA","GREGORIA","DANIEL","ANTONETTE","SHELLI","MOZELLE","MARIAH","JOELLE","CORDELIA","JOSETTE","CHIQUITA","TRISTA","LOUIS","LAQUITA","GEORGIANA","CANDI","SHANON","LONNIE","HILDEGARD","CECIL","VALENTINA","STEPHANY","MAGDA","KAROL","GERRY","GABRIELLA","TIANA","ROMA","RICHELLE","RAY","PRINCESS","OLETA","JACQUE","IDELLA","ALAINA","SUZANNA","JOVITA","BLAIR","TOSHA","RAVEN","NEREIDA","MARLYN","KYLA","JOSEPH","DELFINA","TENA","STEPHENIE","SABINA","NATHALIE","MARCELLE","GERTIE","DARLEEN","THEA","SHARONDA","SHANTEL","BELEN","VENESSA","ROSALINA","ONA","GENOVEVA","COREY","CLEMENTINE","ROSALBA","RENATE","RENATA","MI","IVORY","GEORGIANNA","FLOY","DORCAS","ARIANA","TYRA","THEDA","MARIAM","JULI","JESICA","DONNIE","VIKKI","VERLA","ROSELYN","MELVINA","JANNETTE","GINNY","DEBRAH","CORRIE","ASIA","VIOLETA","MYRTIS","LATRICIA","COLLETTE","CHARLEEN","ANISSA","VIVIANA","TWYLA","PRECIOUS","NEDRA","LATONIA","LAN","HELLEN","FABIOLA","ANNAMARIE","ADELL","SHARYN","CHANTAL","NIKI","MAUD","LIZETTE","LINDY","KIA","KESHA","JEANA","DANELLE","CHARLINE","CHANEL","CARROL","VALORIE","LIA","DORTHA","CRISTAL","SUNNY","LEONE","LEILANI","GERRI","DEBI","ANDRA","KESHIA","IMA","EULALIA","EASTER","DULCE","NATIVIDAD","LINNIE","KAMI","GEORGIE","CATINA","BROOK","ALDA","WINNIFRED","SHARLA","RUTHANN","MEAGHAN","MAGDALENE","LISSETTE","ADELAIDA","VENITA","TRENA","SHIRLENE","SHAMEKA","ELIZEBETH","DIAN","SHANTA","MICKEY","LATOSHA","CARLOTTA","WINDY","SOON","ROSINA","MARIANN","LEISA","JONNIE","DAWNA","CATHIE","BILLY","ASTRID","SIDNEY","LAUREEN","JANEEN","HOLLI","FAWN","VICKEY","TERESSA","SHANTE","RUBYE","MARCELINA","CHANDA","CARY","TERESE","SCARLETT","MARTY","MARNIE","LULU","LISETTE","JENIFFER","ELENOR","DORINDA","DONITA","CARMAN","BERNITA","ALTAGRACIA","ALETA","ADRIANNA","ZORAIDA","RONNIE","NICOLA","LYNDSEY","KENDALL","JANINA","CHRISSY","AMI","STARLA","PHYLIS","PHUONG","KYRA","CHARISSE","BLANCH","SANJUANITA","RONA","NANCI","MARILEE","MARANDA","CORY","BRIGETTE","SANJUANA","MARITA","KASSANDRA","JOYCELYN","IRA","FELIPA","CHELSIE","BONNY","MIREYA","LORENZA","KYONG","ILEANA","CANDELARIA","TONY","TOBY","SHERIE","OK","MARK","LUCIE","LEATRICE","LAKESHIA","GERDA","EDIE","BAMBI","MARYLIN","LAVON","HORTENSE","GARNET","EVIE","TRESSA","SHAYNA","LAVINA","KYUNG","JEANETTA","SHERRILL","SHARA","PHYLISS","MITTIE","ANABEL","ALESIA","THUY","TAWANDA","RICHARD","JOANIE","TIFFANIE","LASHANDA","KARISSA","ENRIQUETA","DARIA","DANIELLA","CORINNA","ALANNA","ABBEY","ROXANE","ROSEANNA","MAGNOLIA","LIDA","KYLE","JOELLEN","ERA","CORAL","CARLEEN","TRESA","PEGGIE","NOVELLA","NILA","MAYBELLE","JENELLE","CARINA","NOVA","MELINA","MARQUERITE","MARGARETTE","JOSEPHINA","EVONNE","DEVIN","CINTHIA","ALBINA","TOYA","TAWNYA","SHERITA","SANTOS","MYRIAM","LIZABETH","LISE","KEELY","JENNI","GISELLE","CHERYLE","ARDITH","ARDIS","ALESHA","ADRIANE","SHAINA","LINNEA","KAROLYN","HONG","FLORIDA","FELISHA","DORI","DARCI","ARTIE","ARMIDA","ZOLA","XIOMARA","VERGIE","SHAMIKA","NENA","NANNETTE","MAXIE","LOVIE","JEANE","JAIMIE","INGE","FARRAH","ELAINA","CAITLYN","STARR","FELICITAS","CHERLY","CARYL","YOLONDA","YASMIN","TEENA","PRUDENCE","PENNIE","NYDIA","MACKENZIE","ORPHA","MARVEL","LIZBETH","LAURETTE","JERRIE","HERMELINDA","CAROLEE","TIERRA","MIRIAN","META","MELONY","KORI","JENNETTE","JAMILA","ENA","ANH","YOSHIKO","SUSANNAH","SALINA","RHIANNON","JOLEEN","CRISTINE","ASHTON","ARACELY","TOMEKA","SHALONDA","MARTI","LACIE","KALA","JADA","ILSE","HAILEY","BRITTANI","ZONA","SYBLE","SHERRYL","RANDY","NIDIA","MARLO","KANDICE","KANDI","DEB","DEAN","AMERICA","ALYCIA","TOMMY","RONNA","NORENE","MERCY","JOSE","INGEBORG","GIOVANNA","GEMMA","CHRISTEL","AUDRY","ZORA","VITA","VAN","TRISH","STEPHAINE","SHIRLEE","SHANIKA","MELONIE","MAZIE","JAZMIN","INGA","HOA","HETTIE","GERALYN","FONDA","ESTRELLA","ADELLA","SU","SARITA","RINA","MILISSA","MARIBETH","GOLDA","EVON","ETHELYN","ENEDINA","CHERISE","CHANA","VELVA","TAWANNA","SADE","MIRTA","LI","KARIE","JACINTA","ELNA","DAVINA","CIERRA","ASHLIE","ALBERTHA","TANESHA","STEPHANI","NELLE","MINDI","LU","LORINDA","LARUE","FLORENE","DEMETRA","DEDRA","CIARA","CHANTELLE","ASHLY","SUZY","ROSALVA","NOELIA","LYDA","LEATHA","KRYSTYNA","KRISTAN","KARRI","DARLINE","DARCIE","CINDA","CHEYENNE","CHERRIE","AWILDA","ALMEDA","ROLANDA","LANETTE","JERILYN","GISELE","EVALYN","CYNDI","CLETA","CARIN","ZINA","ZENA","VELIA","TANIKA","PAUL","CHARISSA","THOMAS","TALIA","MARGARETE","LAVONDA","KAYLEE","KATHLENE","JONNA","IRENA","ILONA","IDALIA","CANDIS","CANDANCE","BRANDEE","ANITRA","ALIDA","SIGRID","NICOLETTE","MARYJO","LINETTE","HEDWIG","CHRISTIANA","CASSIDY","ALEXIA","TRESSIE","MODESTA","LUPITA","LITA","GLADIS","EVELIA","DAVIDA","CHERRI","CECILY","ASHELY","ANNABEL","AGUSTINA","WANITA","SHIRLY","ROSAURA","HULDA","EUN","BAILEY","YETTA","VERONA","THOMASINA","SIBYL","SHANNAN","MECHELLE","LUE","LEANDRA","LANI","KYLEE","KANDY","JOLYNN","FERNE","EBONI","CORENE","ALYSIA","ZULA","NADA","MOIRA","LYNDSAY","LORRETTA","JUAN","JAMMIE","HORTENSIA","GAYNELL","CAMERON","ADRIA","VINA","VICENTA","TANGELA","STEPHINE","NORINE","NELLA","LIANA","LESLEE","KIMBERELY","ILIANA","GLORY","FELICA","EMOGENE","ELFRIEDE","EDEN","EARTHA","CARMA","BEA","OCIE","MARRY","LENNIE","KIARA","JACALYN","CARLOTA","ARIELLE","YU","STAR","OTILIA","KIRSTIN","KACEY","JOHNETTA","JOEY","JOETTA","JERALDINE","JAUNITA","ELANA","DORTHEA","CAMI","AMADA","ADELIA","VERNITA","TAMAR","SIOBHAN","RENEA","RASHIDA","OUIDA","ODELL","NILSA","MERYL","KRISTYN","JULIETA","DANICA","BREANNE","AUREA","ANGLEA","SHERRON","ODETTE","MALIA","LORELEI","LIN","LEESA","KENNA","KATHLYN","FIONA","CHARLETTE","SUZIE","SHANTELL","SABRA","RACQUEL","MYONG","MIRA","MARTINE","LUCIENNE","LAVADA","JULIANN","JOHNIE","ELVERA","DELPHIA","CLAIR","CHRISTIANE","CHAROLETTE","CARRI","AUGUSTINE","ASHA","ANGELLA","PAOLA","NINFA","LEDA","LAI","EDA","SUNSHINE","STEFANI","SHANELL","PALMA","MACHELLE","LISSA","KECIA","KATHRYNE","KARLENE","JULISSA","JETTIE","JENNIFFER","HUI","CORRINA","CHRISTOPHER","CAROLANN","ALENA","TESS","ROSARIA","MYRTICE","MARYLEE","LIANE","KENYATTA","JUDIE","JANEY","IN","ELMIRA","ELDORA","DENNA","CRISTI","CATHI","ZAIDA","VONNIE","VIVA","VERNIE","ROSALINE","MARIELA","LUCIANA","LESLI","KARAN","FELICE","DENEEN","ADINA","WYNONA","TARSHA","SHERON","SHASTA","SHANITA","SHANI","SHANDRA","RANDA","PINKIE","PARIS","NELIDA","MARILOU","LYLA","LAURENE","LACI","JOI","JANENE","DOROTHA","DANIELE","DANI","CAROLYNN","CARLYN","BERENICE","AYESHA","ANNELIESE","ALETHEA","THERSA","TAMIKO","RUFINA","OLIVA","MOZELL","MARYLYN","MADISON","KRISTIAN","KATHYRN","KASANDRA","KANDACE","JANAE","GABRIEL","DOMENICA","DEBBRA","DANNIELLE","CHUN","BUFFY","BARBIE","ARCELIA","AJA","ZENOBIA","SHAREN","SHAREE","PATRICK","PAGE","MY","LAVINIA","KUM","KACIE","JACKELINE","HUONG","FELISA","EMELIA","ELEANORA","CYTHIA","CRISTIN","CLYDE","CLARIBEL","CARON","ANASTACIA","ZULMA","ZANDRA","YOKO","TENISHA","SUSANN","SHERILYN","SHAY","SHAWANDA","SABINE","ROMANA","MATHILDA","LINSEY","KEIKO","JOANA","ISELA","GRETTA","GEORGETTA","EUGENIE","DUSTY","DESIRAE","DELORA","CORAZON","ANTONINA","ANIKA","WILLENE","TRACEE","TAMATHA","REGAN","NICHELLE","MICKIE","MAEGAN","LUANA","LANITA","KELSIE","EDELMIRA","BREE","AFTON","TEODORA","TAMIE","SHENA","MEG","LINH","KELI","KACI","DANYELLE","BRITT","ARLETTE","ALBERTINE","ADELLE","TIFFINY","STORMY","SIMONA","NUMBERS","NICOLASA","NICHOL","NIA","NAKISHA","MEE","MAIRA","LOREEN","KIZZY","JOHNNY","JAY","FALLON","CHRISTENE","BOBBYE","ANTHONY","YING","VINCENZA","TANJA","RUBIE","RONI","QUEENIE","MARGARETT","KIMBERLI","IRMGARD","IDELL","HILMA","EVELINA","ESTA","EMILEE","DENNISE","DANIA","CARL","CARIE","ANTONIO","WAI","SANG","RISA","RIKKI","PARTICIA","MUI","MASAKO","MARIO","LUVENIA","LOREE","LONI","LIEN","KEVIN","GIGI","FLORENCIA","DORIAN","DENITA","DALLAS","CHI","BILLYE","ALEXANDER","TOMIKA","SHARITA","RANA","NIKOLE","NEOMA","MARGARITE","MADALYN","LUCINA","LAILA","KALI","JENETTE","GABRIELE","EVELYNE","ELENORA","CLEMENTINA","ALEJANDRINA","ZULEMA","VIOLETTE","VANNESSA","THRESA","RETTA","PIA","PATIENCE","NOELLA","NICKIE","JONELL","DELTA","CHUNG","CHAYA","CAMELIA","BETHEL","ANYA","ANDREW","THANH","SUZANN","SPRING","SHU","MILA","LILLA","LAVERNA","KEESHA","KATTIE","GIA","GEORGENE","EVELINE","ESTELL","ELIZBETH","VIVIENNE","VALLIE","TRUDIE","STEPHANE","MICHEL","MAGALY","MADIE","KENYETTA","KARREN","JANETTA","HERMINE","HARMONY","DRUCILLA","DEBBI","CELESTINA","CANDIE","BRITNI","BECKIE","AMINA","ZITA","YUN","YOLANDE","VIVIEN","VERNETTA","TRUDI","SOMMER","PEARLE","PATRINA","OSSIE","NICOLLE","LOYCE","LETTY","LARISA","KATHARINA","JOSELYN","JONELLE","JENELL","IESHA","HEIDE","FLORINDA","FLORENTINA","FLO","ELODIA","DORINE","BRUNILDA","BRIGID","ASHLI","ARDELLA","TWANA","THU","TARAH","SUNG","SHEA","SHAVON","SHANE","SERINA","RAYNA","RAMONITA","NGA","MARGURITE","LUCRECIA","KOURTNEY","KATI","JESUS","JESENIA","DIAMOND","CRISTA","AYANA","ALICA","ALIA","VINNIE","SUELLEN","ROMELIA","RACHELL","PIPER","OLYMPIA","MICHIKO","KATHALEEN","JOLIE","JESSI","JANESSA","HANA","HA","ELEASE","CARLETTA","BRITANY","SHONA","SALOME","ROSAMOND","REGENA","RAINA","NGOC","NELIA","LOUVENIA","LESIA","LATRINA","LATICIA","LARHONDA","JINA","JACKI","HOLLIS","HOLLEY","EMMY","DEEANN","CORETTA","ARNETTA","VELVET","THALIA","SHANICE","NETA","MIKKI","MICKI","LONNA","LEANA","LASHUNDA","KILEY","JOYE","JACQULYN","IGNACIA","HYUN","HIROKO","HENRY","HENRIETTE","ELAYNE","DELINDA","DARNELL","DAHLIA","COREEN","CONSUELA","CONCHITA","CELINE","BABETTE","AYANNA","ANETTE","ALBERTINA","SKYE","SHAWNEE","SHANEKA","QUIANA","PAMELIA","MIN","MERRI","MERLENE","MARGIT","KIESHA","KIERA","KAYLENE","JODEE","JENISE","ERLENE","EMMIE","ELSE","DARYL","DALILA","DAISEY","CODY","CASIE","BELIA","BABARA","VERSIE","VANESA","SHELBA","SHAWNDA","SAM","NORMAN","NIKIA","NAOMA","MARNA","MARGERET","MADALINE","LAWANA","KINDRA","JUTTA","JAZMINE","JANETT","HANNELORE","GLENDORA","GERTRUD","GARNETT","FREEDA","FREDERICA","FLORANCE","FLAVIA","DENNIS","CARLINE","BEVERLEE","ANJANETTE","VALDA","TRINITY","TAMALA","STEVIE","SHONNA","SHA","SARINA","ONEIDA","MICAH","MERILYN","MARLEEN","LURLINE","LENNA","KATHERIN","JIN","JENI","HAE","GRACIA","GLADY","FARAH","ERIC","ENOLA","EMA","DOMINQUE","DEVONA","DELANA","CECILA","CAPRICE","ALYSHA","ALI","ALETHIA","VENA","THERESIA","TAWNY","SONG","SHAKIRA","SAMARA","SACHIKO","RACHELE","PAMELLA","NICKY","MARNI","MARIEL","MAREN","MALISA","LIGIA","LERA","LATORIA","LARAE","KIMBER","KATHERN","KAREY","JENNEFER","JANETH","HALINA","FREDIA","DELISA","DEBROAH","CIERA","CHIN","ANGELIKA","ANDREE","ALTHA","YEN","VIVAN","TERRESA","TANNA","SUK","SUDIE","SOO","SIGNE","SALENA","RONNI","REBBECCA","MYRTIE","MCKENZIE","MALIKA","MAIDA","LOAN","LEONARDA","KAYLEIGH","FRANCE","ETHYL","ELLYN","DAYLE","CAMMIE","BRITTNI","BIRGIT","AVELINA","ASUNCION","ARIANNA","AKIKO","VENICE","TYESHA","TONIE","TIESHA","TAKISHA","STEFFANIE","SINDY","SANTANA","MEGHANN","MANDA","MACIE","LADY","KELLYE","KELLEE","JOSLYN","JASON","INGER","INDIRA","GLINDA","GLENNIS","FERNANDA","FAUSTINA","ENEIDA","ELICIA","DOT","DIGNA","DELL","ARLETTA","ANDRE","WILLIA","TAMMARA","TABETHA","SHERRELL","SARI","REFUGIO","REBBECA","PAULETTA","NIEVES","NATOSHA","NAKITA","MAMMIE","KENISHA","KAZUKO","KASSIE","GARY","EARLEAN","DAPHINE","CORLISS","CLOTILDE","CAROLYNE","BERNETTA","AUGUSTINA","AUDREA","ANNIS","ANNABELL","YAN","TENNILLE","TAMICA","SELENE","SEAN","ROSANA","REGENIA","QIANA","MARKITA","MACY","LEEANNE","LAURINE","KYM","JESSENIA","JANITA","GEORGINE","GENIE","EMIKO","ELVIE","DEANDRA","DAGMAR","CORIE","COLLEN","CHERISH","ROMAINE","PORSHA","PEARLENE","MICHELINE","MERNA","MARGORIE","MARGARETTA","LORE","KENNETH","JENINE","HERMINA","FREDERICKA","ELKE","DRUSILLA","DORATHY","DIONE","DESIRE","CELENA","BRIGIDA","ANGELES","ALLEGRA","THEO","TAMEKIA","SYNTHIA","STEPHEN","SOOK","SLYVIA","ROSANN","REATHA","RAYE","MARQUETTA","MARGART","LING","LAYLA","KYMBERLY","KIANA","KAYLEEN","KATLYN","KARMEN","JOELLA","IRINA","EMELDA","ELENI","DETRA","CLEMMIE","CHERYLL","CHANTELL","CATHEY","ARNITA","ARLA","ANGLE","ANGELIC","ALYSE","ZOFIA","THOMASINE","TENNIE","SON","SHERLY","SHERLEY","SHARYL","REMEDIOS","PETRINA","NICKOLE","MYUNG","MYRLE","MOZELLA","LOUANNE","LISHA","LATIA","LANE","KRYSTA","JULIENNE","JOEL","JEANENE","JACQUALINE","ISAURA","GWENDA","EARLEEN","DONALD","CLEOPATRA","CARLIE","AUDIE","ANTONIETTA","ALISE","ALEX","VERDELL","VAL","TYLER","TOMOKO","THAO","TALISHA","STEVEN","SO","SHEMIKA","SHAUN","SCARLET","SAVANNA","SANTINA","ROSIA","RAEANN","ODILIA","NANA","MINNA","MAGAN","LYNELLE","LE","KARMA","JOEANN","IVANA","INELL","ILANA","HYE","HONEY","HEE","GUDRUN","FRANK","DREAMA","CRISSY","CHANTE","CARMELINA","ARVILLA","ARTHUR","ANNAMAE","ALVERA","ALEIDA","AARON","YEE","YANIRA","VANDA","TIANNA","TAM","STEFANIA","SHIRA","PERRY","NICOL","NANCIE","MONSERRATE","MINH","MELYNDA","MELANY","MATTHEW","LOVELLA","LAURE","KIRBY","KACY","JACQUELYNN","HYON","GERTHA","FRANCISCO","ELIANA","CHRISTENA","CHRISTEEN","CHARISE","CATERINA","CARLEY","CANDYCE","ARLENA","AMMIE","YANG","WILLETTE","VANITA","TUYET","TINY","SYREETA","SILVA","SCOTT","RONALD","PENNEY","NYLA","MICHAL","MAURICE","MARYAM","MARYA","MAGEN","LUDIE","LOMA","LIVIA","LANELL","KIMBERLIE","JULEE","DONETTA","DIEDRA","DENISHA","DEANE","DAWNE","CLARINE","CHERRYL","BRONWYN","BRANDON","ALLA","VALERY","TONDA","SUEANN","SORAYA","SHOSHANA","SHELA","SHARLEEN","SHANELLE","NERISSA","MICHEAL","MERIDITH","MELLIE","MAYE","MAPLE","MAGARET","LUIS","LILI","LEONILA","LEONIE","LEEANNA","LAVONIA","LAVERA","KRISTEL","KATHEY","KATHE","JUSTIN","JULIAN","JIMMY","JANN","ILDA","HILDRED","HILDEGARDE","GENIA","FUMIKO","EVELIN","ERMELINDA","ELLY","DUNG","DOLORIS","DIONNA","DANAE","BERNEICE","ANNICE","ALIX","VERENA","VERDIE","TRISTAN","SHAWNNA","SHAWANA","SHAUNNA","ROZELLA","RANDEE","RANAE","MILAGRO","LYNELL","LUISE","LOUIE","LOIDA","LISBETH","KARLEEN","JUNITA","JONA","ISIS","HYACINTH","HEDY","GWENN","ETHELENE","ERLINE","EDWARD","DONYA","DOMONIQUE","DELICIA","DANNETTE","CICELY","BRANDA","BLYTHE","BETHANN","ASHLYN","ANNALEE","ALLINE","YUKO","VELLA","TRANG","TOWANDA","TESHA","SHERLYN","NARCISA","MIGUELINA","MERI","MAYBELL","MARLANA","MARGUERITA","MADLYN","LUNA","LORY","LORIANN","LIBERTY","LEONORE","LEIGHANN","LAURICE","LATESHA","LARONDA","KATRICE","KASIE","KARL","KALEY","JADWIGA","GLENNIE","GEARLDINE","FRANCINA","EPIFANIA","DYAN","DORIE","DIEDRE","DENESE","DEMETRICE","DELENA","DARBY","CRISTIE","CLEORA","CATARINA","CARISA","BERNIE","BARBERA","ALMETA","TRULA","TEREASA","SOLANGE","SHEILAH","SHAVONNE","SANORA","ROCHELL","MATHILDE","MARGARETA","MAIA","LYNSEY","LAWANNA","LAUNA","KENA","KEENA","KATIA","JAMEY","GLYNDA","GAYLENE","ELVINA","ELANOR","DANUTA","DANIKA","CRISTEN","CORDIE","COLETTA","CLARITA","CARMON","BRYNN","AZUCENA","AUNDREA","ANGELE","YI","WALTER","VERLIE","VERLENE","TAMESHA","SILVANA","SEBRINA","SAMIRA","REDA","RAYLENE","PENNI","PANDORA","NORAH","NOMA","MIREILLE","MELISSIA","MARYALICE","LARAINE","KIMBERY","KARYL","KARINE","KAM","JOLANDA","JOHANA","JESUSA","JALEESA","JAE","JACQUELYNE","IRISH","ILUMINADA","HILARIA","HANH","GENNIE","FRANCIE","FLORETTA","EXIE","EDDA","DREMA","DELPHA","BEV","BARBAR","ASSUNTA","ARDELL","ANNALISA","ALISIA","YUKIKO","YOLANDO","WONDA","WEI","WALTRAUD","VETA","TEQUILA","TEMEKA","TAMEIKA","SHIRLEEN","SHENITA","PIEDAD","OZELLA","MIRTHA","MARILU","KIMIKO","JULIANE","JENICE","JEN","JANAY","JACQUILINE","HILDE","FE","FAE","EVAN","EUGENE","ELOIS","ECHO","DEVORAH","CHAU","BRINDA","BETSEY","ARMINDA","ARACELIS","APRYL","ANNETT","ALISHIA","VEOLA","USHA","TOSHIKO","THEOLA","TASHIA","TALITHA","SHERY","RUDY","RENETTA","REIKO","RASHEEDA","OMEGA","OBDULIA","MIKA","MELAINE","MEGGAN","MARTIN","MARLEN","MARGET","MARCELINE","MANA","MAGDALEN","LIBRADA","LEZLIE","LEXIE","LATASHIA","LASANDRA","KELLE","ISIDRA","ISA","INOCENCIA","GWYN","FRANCOISE","ERMINIA","ERINN","DIMPLE","DEVORA","CRISELDA","ARMANDA","ARIE","ARIANE","ANGELO","ANGELENA","ALLEN","ALIZA","ADRIENE","ADALINE","XOCHITL","TWANNA","TRAN","TOMIKO","TAMISHA","TAISHA","SUSY","SIU","RUTHA","ROXY","RHONA","RAYMOND","OTHA","NORIKO","NATASHIA","MERRIE","MELVIN","MARINDA","MARIKO","MARGERT","LORIS","LIZZETTE","LEISHA","KAILA","KA","JOANNIE","JERRICA","JENE","JANNET","JANEE","JACINDA","HERTA","ELENORE","DORETTA","DELAINE","DANIELL","CLAUDIE","CHINA","BRITTA","APOLONIA","AMBERLY","ALEASE","YURI","YUK","WEN","WANETA","UTE","TOMI","SHARRI","SANDIE","ROSELLE","REYNALDA","RAGUEL","PHYLICIA","PATRIA","OLIMPIA","ODELIA","MITZIE","MITCHELL","MISS","MINDA","MIGNON","MICA","MENDY","MARIVEL","MAILE","LYNETTA","LAVETTE","LAURYN","LATRISHA","LAKIESHA","KIERSTEN","KARY","JOSPHINE","JOLYN","JETTA","JANISE","JACQUIE","IVELISSE","GLYNIS","GIANNA","GAYNELLE","EMERALD","DEMETRIUS","DANYELL","DANILLE","DACIA","CORALEE","CHER","CEOLA","BRETT","BELL","ARIANNE","ALESHIA","YUNG","WILLIEMAE","TROY","TRINH","THORA","TAI","SVETLANA","SHERIKA","SHEMEKA","SHAUNDA","ROSELINE","RICKI","MELDA","MALLIE","LAVONNA","LATINA","LARRY","LAQUANDA","LALA","LACHELLE","KLARA","KANDIS","JOHNA","JEANMARIE","JAYE","HANG","GRAYCE","GERTUDE","EMERITA","EBONIE","CLORINDA","CHING","CHERY","CAROLA","BREANN","BLOSSOM","BERNARDINE","BECKI","ARLETHA","ARGELIA","ARA","ALITA","YULANDA","YON","YESSENIA","TOBI","TASIA","SYLVIE","SHIRL","SHIRELY","SHERIDAN","SHELLA","SHANTELLE","SACHA","ROYCE","REBECKA","REAGAN","PROVIDENCIA","PAULENE","MISHA","MIKI","MARLINE","MARICA","LORITA","LATOYIA","LASONYA","KERSTIN","KENDA","KEITHA","KATHRIN","JAYMIE","JACK","GRICELDA","GINETTE","ERYN","ELINA","ELFRIEDA","DANYEL","CHEREE","CHANELLE","BARRIE","AVERY","AURORE","ANNAMARIA","ALLEEN","AILENE","AIDE","YASMINE","VASHTI","VALENTINE","TREASA","TORY","TIFFANEY","SHERYLL","SHARIE","SHANAE","SAU","RAISA","PA","NEDA","MITSUKO","MIRELLA","MILDA","MARYANNA","MARAGRET","MABELLE","LUETTA","LORINA","LETISHA","LATARSHA","LANELLE","LAJUANA","KRISSY","KARLY","KARENA","JON","JESSIKA","JERICA","JEANELLE","JANUARY","JALISA","JACELYN","IZOLA","IVEY","GREGORY","EUNA","ETHA","DREW","DOMITILA","DOMINICA","DAINA","CREOLA","CARLI","CAMIE","BUNNY","BRITTNY","ASHANTI","ANISHA","ALEEN","ADAH","YASUKO","WINTER","VIKI","VALRIE","TONA","TINISHA","THI","TERISA","TATUM","TANEKA","SIMONNE","SHALANDA","SERITA","RESSIE","REFUGIA","PAZ","OLENE","NA","MERRILL","MARGHERITA","MANDIE","MAN","MAIRE","LYNDIA","LUCI","LORRIANE","LORETA","LEONIA","LAVONA","LASHAWNDA","LAKIA","KYOKO","KRYSTINA","KRYSTEN","KENIA","KELSI","JUDE","JEANICE","ISOBEL","GEORGIANN","GENNY","FELICIDAD","EILENE","DEON","DELOISE","DEEDEE","DANNIE","CONCEPTION","CLORA","CHERILYN","CHANG","CALANDRA","BERRY","ARMANDINA","ANISA","ULA","TIMOTHY","TIERA","THERESSA","STEPHANIA","SIMA","SHYLA","SHONTA","SHERA","SHAQUITA","SHALA","SAMMY","ROSSANA","NOHEMI","NERY","MORIAH","MELITA","MELIDA","MELANI","MARYLYNN","MARISHA","MARIETTE","MALORIE","MADELENE","LUDIVINA","LORIA","LORETTE","LORALEE","LIANNE","LEON","LAVENIA","LAURINDA","LASHON","KIT","KIMI","KEILA","KATELYNN","KAI","JONE","JOANE","JI","JAYNA","JANELLA","JA","HUE","HERTHA","FRANCENE","ELINORE","DESPINA","DELSIE","DEEDRA","CLEMENCIA","CARRY","CAROLIN","CARLOS","BULAH","BRITTANIE","BOK","BLONDELL","BIBI","BEAULAH","BEATA","ANNITA","AGRIPINA","VIRGEN","VALENE","UN","TWANDA","TOMMYE","TOI","TARRA","TARI","TAMMERA","SHAKIA","SADYE","RUTHANNE","ROCHEL","RIVKA","PURA","NENITA","NATISHA","MING","MERRILEE","MELODEE","MARVIS","LUCILLA","LEENA","LAVETA","LARITA","LANIE","KEREN","ILEEN","GEORGEANN","GENNA","GENESIS","FRIDA","EWA","EUFEMIA","EMELY","ELA","EDYTH","DEONNA","DEADRA","DARLENA","CHANELL","CHAN","CATHERN","CASSONDRA","CASSAUNDRA","BERNARDA","BERNA","ARLINDA","ANAMARIA","ALBERT","WESLEY","VERTIE","VALERI","TORRI","TATYANA","STASIA","SHERISE","SHERILL","SEASON","SCOTTIE","SANDA","RUTHE","ROSY","ROBERTO","ROBBI","RANEE","QUYEN","PEARLY","PALMIRA","ONITA","NISHA","NIESHA","NIDA","NEVADA","NAM","MERLYN","MAYOLA","MARYLOUISE","MARYLAND","MARX","MARTH","MARGENE","MADELAINE","LONDA","LEONTINE","LEOMA","LEIA","LAWRENCE","LAURALEE","LANORA","LAKITA","KIYOKO","KETURAH","KATELIN","KAREEN","JONIE","JOHNETTE","JENEE","JEANETT","IZETTA","HIEDI","HEIKE","HASSIE","HAROLD","GIUSEPPINA","GEORGANN","FIDELA","FERNANDE","ELWANDA","ELLAMAE","ELIZ","DUSTI","DOTTY","CYNDY","CORALIE","CELESTA","ARGENTINA","ALVERTA","XENIA","WAVA","VANETTA","TORRIE","TASHINA","TANDY","TAMBRA","TAMA","STEPANIE","SHILA","SHAUNTA","SHARAN","SHANIQUA","SHAE","SETSUKO","SERAFINA","SANDEE","ROSAMARIA","PRISCILA","OLINDA","NADENE","MUOI","MICHELINA","MERCEDEZ","MARYROSE","MARIN","MARCENE","MAO","MAGALI","MAFALDA","LOGAN","LINN","LANNIE","KAYCE","KAROLINE","KAMILAH","KAMALA","JUSTA","JOLINE","JENNINE","JACQUETTA","IRAIDA","GERALD","GEORGEANNA","FRANCHESCA","FAIRY","EMELINE","ELANE","EHTEL","EARLIE","DULCIE","DALENE","CRIS","CLASSIE","CHERE","CHARIS","CAROYLN","CARMINA","CARITA","BRIAN","BETHANIE","AYAKO","ARICA","AN","ALYSA","ALESSANDRA","AKILAH","ADRIEN","ZETTA","YOULANDA","YELENA","YAHAIRA","XUAN","WENDOLYN","VICTOR","TIJUANA","TERRELL","TERINA","TERESIA","SUZI","SUNDAY","SHERELL","SHAVONDA","SHAUNTE","SHARDA","SHAKITA","SENA","RYANN","RUBI","RIVA","REGINIA","REA","RACHAL","PARTHENIA","PAMULA","MONNIE","MONET","MICHAELE","MELIA","MARINE","MALKA","MAISHA","LISANDRA","LEO","LEKISHA","LEAN","LAURENCE","LAKENDRA","KRYSTIN","KORTNEY","KIZZIE","KITTIE","KERA","KENDAL","KEMBERLY","KANISHA","JULENE","JULE","JOSHUA","JOHANNE","JEFFREY","JAMEE","HAN","HALLEY","GIDGET","GALINA","FREDRICKA","FLETA","FATIMAH","EUSEBIA","ELZA","ELEONORE","DORTHEY","DORIA","DONELLA","DINORAH","DELORSE","CLARETHA","CHRISTINIA","CHARLYN","BONG","BELKIS","AZZIE","ANDERA","AIKO","ADENA","YER","YAJAIRA","WAN","VANIA","ULRIKE","TOSHIA","TIFANY","STEFANY","SHIZUE","SHENIKA","SHAWANNA","SHAROLYN","SHARILYN","SHAQUANA","SHANTAY","SEE","ROZANNE","ROSELEE","RICKIE","REMONA","REANNA","RAELENE","QUINN","PHUNG","PETRONILA","NATACHA","NANCEY","MYRL","MIYOKO","MIESHA","MERIDETH","MARVELLA","MARQUITTA","MARHTA","MARCHELLE","LIZETH","LIBBIE","LAHOMA","LADAWN","KINA","KATHELEEN","KATHARYN","KARISA","KALEIGH","JUNIE","JULIEANN","JOHNSIE","JANEAN","JAIMEE","JACKQUELINE","HISAKO","HERMA","HELAINE","GWYNETH","GLENN","GITA","EUSTOLIA","EMELINA","ELIN","EDRIS","DONNETTE","DONNETTA","DIERDRE","DENAE","DARCEL","CLAUDE","CLARISA","CINDERELLA","CHIA","CHARLESETTA","CHARITA","CELSA","CASSY","CASSI","CARLEE","BRUNA","BRITTANEY","BRANDE","BILLI","BAO","ANTONETTA","ANGLA","ANGELYN","ANALISA","ALANE","WENONA","WENDIE","VERONIQUE","VANNESA","TOBIE","TEMPIE","SUMIKO","SULEMA","SPARKLE","SOMER","SHEBA","SHAYNE","SHARICE","SHANEL","SHALON","SAGE","ROY","ROSIO","ROSELIA","RENAY","REMA","REENA","PORSCHE","PING","PEG","OZIE","ORETHA","ORALEE","ODA","NU","NGAN","NAKESHA","MILLY","MARYBELLE","MARLIN","MARIS","MARGRETT","MARAGARET","MANIE","LURLENE","LILLIA","LIESELOTTE","LAVELLE","LASHAUNDA","LAKEESHA","KEITH","KAYCEE","KALYN","JOYA","JOETTE","JENAE","JANIECE","ILLA","GRISEL","GLAYDS","GENEVIE","GALA","FREDDA","FRED","ELMER","ELEONOR","DEBERA","DEANDREA","DAN","CORRINNE","CORDIA","CONTESSA","COLENE","CLEOTILDE","CHARLOTT","CHANTAY","CECILLE","BEATRIS","AZALEE","ARLEAN","ARDATH","ANJELICA","ANJA","ALFREDIA","ALEISHA","ADAM","ZADA","YUONNE","XIAO","WILLODEAN","WHITLEY","VENNIE","VANNA","TYISHA","TOVA","TORIE","TONISHA","TILDA","TIEN","TEMPLE","SIRENA","SHERRIL","SHANTI","SHAN","SENAIDA","SAMELLA","ROBBYN","RENDA","REITA","PHEBE","PAULITA","NOBUKO","NGUYET","NEOMI","MOON","MIKAELA","MELANIA","MAXIMINA","MARG","MAISIE","LYNNA","LILLI","LAYNE","LASHAUN","LAKENYA","LAEL","KIRSTIE","KATHLINE","KASHA","KARLYN","KARIMA","JOVAN","JOSEFINE","JENNELL","JACQUI","JACKELYN","HYO","HIEN","GRAZYNA","FLORRIE","FLORIA","ELEONORA","DWANA","DORLA","DONG","DELMY","DEJA","DEDE","DANN","CRYSTA","CLELIA","CLARIS","CLARENCE","CHIEKO","CHERLYN","CHERELLE","CHARMAIN","CHARA","CAMMY","BEE","ARNETTE","ARDELLE","ANNIKA","AMIEE","AMEE","ALLENA","YVONE","YUKI","YOSHIE","YEVETTE","YAEL","WILLETTA","VONCILE","VENETTA","TULA","TONETTE","TIMIKA","TEMIKA","TELMA","TEISHA","TAREN","TA","STACEE","SHIN","SHAWNTA","SATURNINA","RICARDA","POK","PASTY","ONIE","NUBIA","MORA","MIKE","MARIELLE","MARIELLA","MARIANELA","MARDELL","MANY","LUANNA","LOISE","LISABETH","LINDSY","LILLIANA","LILLIAM","LELAH","LEIGHA","LEANORA","LANG","KRISTEEN","KHALILAH","KEELEY","KANDRA","JUNKO","JOAQUINA","JERLENE","JANI","JAMIKA","JAME","HSIU","HERMILA","GOLDEN","GENEVIVE","EVIA","EUGENA","EMMALINE","ELFREDA","ELENE","DONETTE","DELCIE","DEEANNA","DARCEY","CUC","CLARINDA","CIRA","CHAE","CELINDA","CATHERYN","CATHERIN","CASIMIRA","CARMELIA","CAMELLIA","BREANA","BOBETTE","BERNARDINA","BEBE","BASILIA","ARLYNE","AMAL","ALAYNA","ZONIA","ZENIA","YURIKO","YAEKO","WYNELL","WILLOW","WILLENA","VERNIA","TU","TRAVIS","TORA","TERRILYN","TERICA","TENESHA","TAWNA","TAJUANA","TAINA","STEPHNIE","SONA","SOL","SINA","SHONDRA","SHIZUKO","SHERLENE","SHERICE","SHARIKA","ROSSIE","ROSENA","RORY","RIMA","RIA","RHEBA","RENNA","PETER","NATALYA","NANCEE","MELODI","MEDA","MAXIMA","MATHA","MARKETTA","MARICRUZ","MARCELENE","MALVINA","LUBA","LOUETTA","LEIDA","LECIA","LAURAN","LASHAWNA","LAINE","KHADIJAH","KATERINE","KASI","KALLIE","JULIETTA","JESUSITA","JESTINE","JESSIA","JEREMY","JEFFIE","JANYCE","ISADORA","GEORGIANNE","FIDELIA","EVITA","EURA","EULAH","ESTEFANA","ELSY","ELIZABET","ELADIA","DODIE","DION","DIA","DENISSE","DELORAS","DELILA","DAYSI","DAKOTA","CURTIS","CRYSTLE","CONCHA","COLBY","CLARETTA","CHU","CHRISTIA","CHARLSIE","CHARLENA","CARYLON","BETTYANN","ASLEY","ASHLEA","AMIRA","AI","AGUEDA","AGNUS","YUETTE","VINITA","VICTORINA","TYNISHA","TREENA","TOCCARA","TISH","THOMASENA","TEGAN","SOILA","SHILOH","SHENNA","SHARMAINE","SHANTAE","SHANDI","SEPTEMBER","SARAN","SARAI","SANA","SAMUEL","SALLEY","ROSETTE","ROLANDE","REGINE","OTELIA","OSCAR","OLEVIA","NICHOLLE","NECOLE","NAIDA","MYRTA","MYESHA","MITSUE","MINTA","MERTIE","MARGY","MAHALIA","MADALENE","LOVE","LOURA","LOREAN","LEWIS","LESHA","LEONIDA","LENITA","LAVONE","LASHELL","LASHANDRA","LAMONICA","KIMBRA","KATHERINA","KARRY","KANESHA","JULIO","JONG","JENEVA","JAQUELYN","HWA","GILMA","GHISLAINE","GERTRUDIS","FRANSISCA","FERMINA","ETTIE","ETSUKO","ELLIS","ELLAN","ELIDIA","EDRA","DORETHEA","DOREATHA","DENYSE","DENNY","DEETTA","DAINE","CYRSTAL","CORRIN","CAYLA","CARLITA","CAMILA","BURMA","BULA","BUENA","BLAKE","BARABARA","AVRIL","AUSTIN","ALAINE","ZANA","WILHEMINA","WANETTA","VIRGIL","VI","VERONIKA","VERNON","VERLINE","VASILIKI","TONITA","TISA","TEOFILA","TAYNA","TAUNYA","TANDRA","TAKAKO","SUNNI","SUANNE","SIXTA","SHARELL","SEEMA","RUSSELL","ROSENDA","ROBENA","RAYMONDE","PEI","PAMILA","OZELL","NEIDA","NEELY","MISTIE","MICHA","MERISSA","MAURITA","MARYLN","MARYETTA","MARSHALL","MARCELL","MALENA","MAKEDA","MADDIE","LOVETTA","LOURIE","LORRINE","LORILEE","LESTER","LAURENA","LASHAY","LARRAINE","LAREE","LACRESHA","KRISTLE","KRISHNA","KEVA","KEIRA","KAROLE","JOIE","JINNY","JEANNETTA","JAMA","HEIDY","GILBERTE","GEMA","FAVIOLA","EVELYNN","ENDA","ELLI","ELLENA","DIVINA","DAGNY","COLLENE","CODI","CINDIE","CHASSIDY","CHASIDY","CATRICE","CATHERINA","CASSEY","CAROLL","CARLENA","CANDRA","CALISTA","BRYANNA","BRITTENY","BEULA","BARI","AUDRIE","AUDRIA","ARDELIA","ANNELLE","ANGILA","ALONA","ALLYN","DOUGLAS","ROGER","JONATHAN","RALPH","NICHOLAS","BENJAMIN","BRUCE","HARRY","WAYNE","STEVE","HOWARD","ERNEST","PHILLIP","TODD","CRAIG","ALAN","PHILIP","EARL","DANNY","BRYAN","STANLEY","LEONARD","NATHAN","MANUEL","RODNEY","MARVIN","VINCENT","JEFFERY","JEFF","CHAD","JACOB","ALFRED","BRADLEY","HERBERT","FREDERICK","EDWIN","DON","RICKY","RANDALL","BARRY","BERNARD","LEROY","MARCUS","THEODORE","CLIFFORD","MIGUEL","JIM","TOM","CALVIN","BILL","LLOYD","DEREK","WARREN","DARRELL","JEROME","FLOYD","ALVIN","TIM","GORDON","GREG","JORGE","DUSTIN","PEDRO","DERRICK","ZACHARY","HERMAN","GLEN","HECTOR","RICARDO","RICK","BRENT","RAMON","GILBERT","MARC","REGINALD","RUBEN","NATHANIEL","RAFAEL","EDGAR","MILTON","RAUL","BEN","CHESTER","DUANE","FRANKLIN","BRAD","RON","ROLAND","ARNOLD","HARVEY","JARED","ERIK","DARRYL","NEIL","JAVIER","FERNANDO","CLINTON","TED","MATHEW","TYRONE","DARREN","LANCE","KURT","ALLAN","NELSON","GUY","CLAYTON","HUGH","MAX","DWAYNE","DWIGHT","ARMANDO","FELIX","EVERETT","IAN","WALLACE","KEN","BOB","ALFREDO","ALBERTO","DAVE","IVAN","BYRON","ISAAC","MORRIS","CLIFTON","WILLARD","ROSS","ANDY","SALVADOR","KIRK","SERGIO","SETH","KENT","TERRANCE","EDUARDO","TERRENCE","ENRIQUE","WADE","STUART","FREDRICK","ARTURO","ALEJANDRO","NICK","LUTHER","WENDELL","JEREMIAH","JULIUS","OTIS","TREVOR","OLIVER","LUKE","HOMER","GERARD","DOUG","KENNY","HUBERT","LYLE","MATT","ALFONSO","ORLANDO","REX","CARLTON","ERNESTO","NEAL","PABLO","LORENZO","OMAR","WILBUR","GRANT","HORACE","RODERICK","ABRAHAM","WILLIS","RICKEY","ANDRES","CESAR","JOHNATHAN","MALCOLM","RUDOLPH","DAMON","KELVIN","PRESTON","ALTON","ARCHIE","MARCO","WM","PETE","RANDOLPH","GARRY","GEOFFREY","JONATHON","FELIPE","GERARDO","ED","DOMINIC","DELBERT","COLIN","GUILLERMO","EARNEST","LUCAS","BENNY","SPENCER","RODOLFO","MYRON","EDMUND","GARRETT","SALVATORE","CEDRIC","LOWELL","GREGG","SHERMAN","WILSON","SYLVESTER","ROOSEVELT","ISRAEL","JERMAINE","FORREST","WILBERT","LELAND","SIMON","CLARK","IRVING","BRYANT","OWEN","RUFUS","WOODROW","KRISTOPHER","MACK","LEVI","MARCOS","GUSTAVO","JAKE","LIONEL","GILBERTO","CLINT","NICOLAS","ISMAEL","ORVILLE","ERVIN","DEWEY","AL","WILFRED","JOSH","HUGO","IGNACIO","CALEB","TOMAS","SHELDON","ERICK","STEWART","DOYLE","DARREL","ROGELIO","TERENCE","SANTIAGO","ALONZO","ELIAS","BERT","ELBERT","RAMIRO","CONRAD","NOAH","GRADY","PHIL","CORNELIUS","LAMAR","ROLANDO","CLAY","PERCY","DEXTER","BRADFORD","DARIN","AMOS","MOSES","IRVIN","SAUL","ROMAN","RANDAL","TIMMY","DARRIN","WINSTON","BRENDAN","ABEL","DOMINICK","BOYD","EMILIO","ELIJAH","DOMINGO","EMMETT","MARLON","EMANUEL","JERALD","EDMOND","EMIL","DEWAYNE","WILL","OTTO","TEDDY","REYNALDO","BRET","JESS","TRENT","HUMBERTO","EMMANUEL","STEPHAN","VICENTE","LAMONT","GARLAND","MILES","EFRAIN","HEATH","RODGER","HARLEY","ETHAN","ELDON","ROCKY","PIERRE","JUNIOR","FREDDY","ELI","BRYCE","ANTOINE","STERLING","CHASE","GROVER","ELTON","CLEVELAND","DYLAN","CHUCK","DAMIAN","REUBEN","STAN","AUGUST","LEONARDO","JASPER","RUSSEL","ERWIN","BENITO","HANS","MONTE","BLAINE","ERNIE","CURT","QUENTIN","AGUSTIN","MURRAY","JAMAL","ADOLFO","HARRISON","TYSON","BURTON","BRADY","ELLIOTT","WILFREDO","BART","JARROD","VANCE","DENIS","DAMIEN","JOAQUIN","HARLAN","DESMOND","ELLIOT","DARWIN","GREGORIO","BUDDY","XAVIER","KERMIT","ROSCOE","ESTEBAN","ANTON","SOLOMON","SCOTTY","NORBERT","ELVIN","WILLIAMS","NOLAN","ROD","QUINTON","HAL","BRAIN","ROB","ELWOOD","KENDRICK","DARIUS","MOISES","FIDEL","THADDEUS","CLIFF","MARCEL","JACKSON","RAPHAEL","BRYON","ARMAND","ALVARO","JEFFRY","DANE","JOESPH","THURMAN","NED","RUSTY","MONTY","FABIAN","REGGIE","MASON","GRAHAM","ISAIAH","VAUGHN","GUS","LOYD","DIEGO","ADOLPH","NORRIS","MILLARD","ROCCO","GONZALO","DERICK","RODRIGO","WILEY","RIGOBERTO","ALPHONSO","TY","NOE","VERN","REED","JEFFERSON","ELVIS","BERNARDO","MAURICIO","HIRAM","DONOVAN","BASIL","RILEY","NICKOLAS","MAYNARD","SCOT","VINCE","QUINCY","EDDY","SEBASTIAN","FEDERICO","ULYSSES","HERIBERTO","DONNELL","COLE","DAVIS","GAVIN","EMERY","WARD","ROMEO","JAYSON","DANTE","CLEMENT","COY","MAXWELL","JARVIS","BRUNO","ISSAC","DUDLEY","BROCK","SANFORD","CARMELO","BARNEY","NESTOR","STEFAN","DONNY","ART","LINWOOD","BEAU","WELDON","GALEN","ISIDRO","TRUMAN","DELMAR","JOHNATHON","SILAS","FREDERIC","DICK","IRWIN","MERLIN","CHARLEY","MARCELINO","HARRIS","CARLO","TRENTON","KURTIS","HUNTER","AURELIO","WINFRED","VITO","COLLIN","DENVER","CARTER","LEONEL","EMORY","PASQUALE","MOHAMMAD","MARIANO","DANIAL","LANDON","DIRK","BRANDEN","ADAN","BUFORD","GERMAN","WILMER","EMERSON","ZACHERY","FLETCHER","JACQUES","ERROL","DALTON","MONROE","JOSUE","EDWARDO","BOOKER","WILFORD","SONNY","SHELTON","CARSON","THERON","RAYMUNDO","DAREN","HOUSTON","ROBBY","LINCOLN","GENARO","BENNETT","OCTAVIO","CORNELL","HUNG","ARRON","ANTONY","HERSCHEL","GIOVANNI","GARTH","CYRUS","CYRIL","RONNY","LON","FREEMAN","DUNCAN","KENNITH","CARMINE","ERICH","CHADWICK","WILBURN","RUSS","REID","MYLES","ANDERSON","MORTON","JONAS","FOREST","MITCHEL","MERVIN","ZANE","RICH","JAMEL","LAZARO","ALPHONSE","RANDELL","MAJOR","JARRETT","BROOKS","ABDUL","LUCIANO","SEYMOUR","EUGENIO","MOHAMMED","VALENTIN","CHANCE","ARNULFO","LUCIEN","FERDINAND","THAD","EZRA","ALDO","RUBIN","ROYAL","MITCH","EARLE","ABE","WYATT","MARQUIS","LANNY","KAREEM","JAMAR","BORIS","ISIAH","EMILE","ELMO","ARON","LEOPOLDO","EVERETTE","JOSEF","ELOY","RODRICK","REINALDO","LUCIO","JERROD","WESTON","HERSHEL","BARTON","PARKER","LEMUEL","BURT","JULES","GIL","ELISEO","AHMAD","NIGEL","EFREN","ANTWAN","ALDEN","MARGARITO","COLEMAN","DINO","OSVALDO","LES","DEANDRE","NORMAND","KIETH","TREY","NORBERTO","NAPOLEON","JEROLD","FRITZ","ROSENDO","MILFORD","CHRISTOPER","ALFONZO","LYMAN","JOSIAH","BRANT","WILTON","RICO","JAMAAL","DEWITT","BRENTON","OLIN","FOSTER","FAUSTINO","CLAUDIO","JUDSON","GINO","EDGARDO","ALEC","TANNER","JARRED","DONN","TAD","PRINCE","PORFIRIO","ODIS","LENARD","CHAUNCEY","TOD","MEL","MARCELO","KORY","AUGUSTUS","KEVEN","HILARIO","BUD","SAL","ORVAL","MAURO","ZACHARIAH","OLEN","ANIBAL","MILO","JED","DILLON","AMADO","NEWTON","LENNY","RICHIE","HORACIO","BRICE","MOHAMED","DELMER","DARIO","REYES","MAC","JONAH","JERROLD","ROBT","HANK","RUPERT","ROLLAND","KENTON","DAMION","ANTONE","WALDO","FREDRIC","BRADLY","KIP","BURL","WALKER","TYREE","JEFFEREY","AHMED","WILLY","STANFORD","OREN","NOBLE","MOSHE","MIKEL","ENOCH","BRENDON","QUINTIN","JAMISON","FLORENCIO","DARRICK","TOBIAS","HASSAN","GIUSEPPE","DEMARCUS","CLETUS","TYRELL","LYNDON","KEENAN","WERNER","GERALDO","COLUMBUS","CHET","BERTRAM","MARKUS","HUEY","HILTON","DWAIN","DONTE","TYRON","OMER","ISAIAS","HIPOLITO","FERMIN","ADALBERTO","BO","BARRETT","TEODORO","MCKINLEY","MAXIMO","GARFIELD","RALEIGH","LAWERENCE","ABRAM","RASHAD","KING","EMMITT","DARON","SAMUAL","MIQUEL","EUSEBIO","DOMENIC","DARRON","BUSTER","WILBER","RENATO","JC","HOYT","HAYWOOD","EZEKIEL","CHAS","FLORENTINO","ELROY","CLEMENTE","ARDEN","NEVILLE","EDISON","DESHAWN","NATHANIAL","JORDON","DANILO","CLAUD","SHERWOOD","RAYMON","RAYFORD","CRISTOBAL","AMBROSE","TITUS","HYMAN","FELTON","EZEQUIEL","ERASMO","STANTON","LONNY","LEN","IKE","MILAN","LINO","JAROD","HERB","ANDREAS","WALTON","RHETT","PALMER","DOUGLASS","CORDELL","OSWALDO","ELLSWORTH","VIRGILIO","TONEY","NATHANAEL","DEL","BENEDICT","MOSE","JOHNSON","ISREAL","GARRET","FAUSTO","ASA","ARLEN","ZACK","WARNER","MODESTO","FRANCESCO","MANUAL","GAYLORD","GASTON","FILIBERTO","DEANGELO","MICHALE","GRANVILLE","WES","MALIK","ZACKARY","TUAN","ELDRIDGE","CRISTOPHER","CORTEZ","ANTIONE","MALCOM","LONG","KOREY","JOSPEH","COLTON","WAYLON","VON","HOSEA","SHAD","SANTO","RUDOLF","ROLF","REY","RENALDO","MARCELLUS","LUCIUS","KRISTOFER","BOYCE","BENTON","HAYDEN","HARLAND","ARNOLDO","RUEBEN","LEANDRO","KRAIG","JERRELL","JEROMY","HOBERT","CEDRICK","ARLIE","WINFORD","WALLY","LUIGI","KENETH","JACINTO","GRAIG","FRANKLYN","EDMUNDO","SID","PORTER","LEIF","JERAMY","BUCK","WILLIAN","VINCENZO","SHON","LYNWOOD","JERE","HAI","ELDEN","DORSEY","DARELL","BRODERICK","ALONSO"
\ No newline at end of file
diff --git a/Project Euler/Problem 22/sol1.py b/Project Euler/Problem 22/sol1.py
new file mode 100644
index 000000000000..7754306583dc
--- /dev/null
+++ b/Project Euler/Problem 22/sol1.py	
@@ -0,0 +1,37 @@
+# -*- coding: latin-1 -*-
+from __future__ import print_function
+'''
+Name scores
+Problem 22
+
+Using names.txt (right click and 'Save Link/Target As...'), a 46K text file containing over five-thousand first names, begin by sorting it 
+into alphabetical order. Then working out the alphabetical value for each name, multiply this value by its alphabetical position in the list 
+to obtain a name score.
+
+For example, when the list is sorted into alphabetical order, COLIN, which is worth 3 + 15 + 12 + 9 + 14 = 53, is the 938th name in the list. 
+So, COLIN would obtain a score of 938 × 53 = 49714.
+
+What is the total of all the name scores in the file?
+'''
+try:
+	xrange		#Python 2
+except NameError:
+	xrange = range	#Python 3
+
+with open('p022_names.txt') as file:
+	names = str(file.readlines()[0])
+	names = names.replace('"', '').split(',')
+
+names.sort()
+
+name_score = 0
+total_score = 0
+
+for i, name in enumerate(names):
+	for letter in name:
+		name_score += ord(letter) - 64
+
+	total_score += (i+1)*name_score
+	name_score = 0
+
+print(total_score)
\ No newline at end of file
diff --git a/Project Euler/Problem 22/sol2.py b/Project Euler/Problem 22/sol2.py
new file mode 100644
index 000000000000..d7f9abf09d49
--- /dev/null
+++ b/Project Euler/Problem 22/sol2.py	
@@ -0,0 +1,533 @@
+def main():
+	name = [  
+	"MARY", "PATRICIA", "LINDA", "BARBARA", "ELIZABETH", "JENNIFER", "MARIA", "SUSAN", "MARGARET", "DOROTHY",
+	"LISA", "NANCY", "KAREN", "BETTY", "HELEN", "SANDRA", "DONNA", "CAROL", "RUTH", "SHARON",
+	"MICHELLE", "LAURA", "SARAH", "KIMBERLY", "DEBORAH", "JESSICA", "SHIRLEY", "CYNTHIA", "ANGELA", "MELISSA",
+	"BRENDA", "AMY", "ANNA", "REBECCA", "VIRGINIA", "KATHLEEN", "PAMELA", "MARTHA", "DEBRA", "AMANDA",
+	"STEPHANIE", "CAROLYN", "CHRISTINE", "MARIE", "JANET", "CATHERINE", "FRANCES", "ANN", "JOYCE", "DIANE",
+	"ALICE", "JULIE", "HEATHER", "TERESA", "DORIS", "GLORIA", "EVELYN", "JEAN", "CHERYL", "MILDRED",
+	"KATHERINE", "JOAN", "ASHLEY", "JUDITH", "ROSE", "JANICE", "KELLY", "NICOLE", "JUDY", "CHRISTINA",
+	"KATHY", "THERESA", "BEVERLY", "DENISE", "TAMMY", "IRENE", "JANE", "LORI", "RACHEL", "MARILYN",
+	"ANDREA", "KATHRYN", "LOUISE", "SARA", "ANNE", "JACQUELINE", "WANDA", "BONNIE", "JULIA", "RUBY",
+	"LOIS", "TINA", "PHYLLIS", "NORMA", "PAULA", "DIANA", "ANNIE", "LILLIAN", "EMILY", "ROBIN",
+	"PEGGY", "CRYSTAL", "GLADYS", "RITA", "DAWN", "CONNIE", "FLORENCE", "TRACY", "EDNA", "TIFFANY",
+	"CARMEN", "ROSA", "CINDY", "GRACE", "WENDY", "VICTORIA", "EDITH", "KIM", "SHERRY", "SYLVIA",
+	"JOSEPHINE", "THELMA", "SHANNON", "SHEILA", "ETHEL", "ELLEN", "ELAINE", "MARJORIE", "CARRIE", "CHARLOTTE",
+	"MONICA", "ESTHER", "PAULINE", "EMMA", "JUANITA", "ANITA", "RHONDA", "HAZEL", "AMBER", "EVA",
+	"DEBBIE", "APRIL", "LESLIE", "CLARA", "LUCILLE", "JAMIE", "JOANNE", "ELEANOR", "VALERIE", "DANIELLE",
+	"MEGAN", "ALICIA", "SUZANNE", "MICHELE", "GAIL", "BERTHA", "DARLENE", "VERONICA", "JILL", "ERIN",
+	"GERALDINE", "LAUREN", "CATHY", "JOANN", "LORRAINE", "LYNN", "SALLY", "REGINA", "ERICA", "BEATRICE",
+	"DOLORES", "BERNICE", "AUDREY", "YVONNE", "ANNETTE", "JUNE", "SAMANTHA", "MARION", "DANA", "STACY",
+	"ANA", "RENEE", "IDA", "VIVIAN", "ROBERTA", "HOLLY", "BRITTANY", "MELANIE", "LORETTA", "YOLANDA",
+	"JEANETTE", "LAURIE", "KATIE", "KRISTEN", "VANESSA", "ALMA", "SUE", "ELSIE", "BETH", "JEANNE",
+	"VICKI", "CARLA", "TARA", "ROSEMARY", "EILEEN", "TERRI", "GERTRUDE", "LUCY", "TONYA", "ELLA",
+	"STACEY", "WILMA", "GINA", "KRISTIN", "JESSIE", "NATALIE", "AGNES", "VERA", "WILLIE", "CHARLENE",
+	"BESSIE", "DELORES", "MELINDA", "PEARL", "ARLENE", "MAUREEN", "COLLEEN", "ALLISON", "TAMARA", "JOY",
+	"GEORGIA", "CONSTANCE", "LILLIE", "CLAUDIA", "JACKIE", "MARCIA", "TANYA", "NELLIE", "MINNIE", "MARLENE",
+	"HEIDI", "GLENDA", "LYDIA", "VIOLA", "COURTNEY", "MARIAN", "STELLA", "CAROLINE", "DORA", "JO",
+	"VICKIE", "MATTIE", "TERRY", "MAXINE", "IRMA", "MABEL", "MARSHA", "MYRTLE", "LENA", "CHRISTY",
+	"DEANNA", "PATSY", "HILDA", "GWENDOLYN", "JENNIE", "NORA", "MARGIE", "NINA", "CASSANDRA", "LEAH",
+	"PENNY", "KAY", "PRISCILLA", "NAOMI", "CAROLE", "BRANDY", "OLGA", "BILLIE", "DIANNE", "TRACEY",
+	"LEONA", "JENNY", "FELICIA", "SONIA", "MIRIAM", "VELMA", "BECKY", "BOBBIE", "VIOLET", "KRISTINA",
+	"TONI", "MISTY", "MAE", "SHELLY", "DAISY", "RAMONA", "SHERRI", "ERIKA", "KATRINA", "CLAIRE",
+	"LINDSEY", "LINDSAY", "GENEVA", "GUADALUPE", "BELINDA", "MARGARITA", "SHERYL", "CORA", "FAYE", "ADA",
+	"NATASHA", "SABRINA", "ISABEL", "MARGUERITE", "HATTIE", "HARRIET", "MOLLY", "CECILIA", "KRISTI", "BRANDI",
+	"BLANCHE", "SANDY", "ROSIE", "JOANNA", "IRIS", "EUNICE", "ANGIE", "INEZ", "LYNDA", "MADELINE",
+	"AMELIA", "ALBERTA", "GENEVIEVE", "MONIQUE", "JODI", "JANIE", "MAGGIE", "KAYLA", "SONYA", "JAN",
+	"LEE", "KRISTINE", "CANDACE", "FANNIE", "MARYANN", "OPAL", "ALISON", "YVETTE", "MELODY", "LUZ",
+	"SUSIE", "OLIVIA", "FLORA", "SHELLEY", "KRISTY", "MAMIE", "LULA", "LOLA", "VERNA", "BEULAH",
+	"ANTOINETTE", "CANDICE", "JUANA", "JEANNETTE", "PAM", "KELLI", "HANNAH", "WHITNEY", "BRIDGET", "KARLA",
+	"CELIA", "LATOYA", "PATTY", "SHELIA", "GAYLE", "DELLA", "VICKY", "LYNNE", "SHERI", "MARIANNE",
+	"KARA", "JACQUELYN", "ERMA", "BLANCA", "MYRA", "LETICIA", "PAT", "KRISTA", "ROXANNE", "ANGELICA",
+	"JOHNNIE", "ROBYN", "FRANCIS", "ADRIENNE", "ROSALIE", "ALEXANDRA", "BROOKE", "BETHANY", "SADIE", "BERNADETTE",
+	"TRACI", "JODY", "KENDRA", "JASMINE", "NICHOLE", "RACHAEL", "CHELSEA", "MABLE", "ERNESTINE", "MURIEL",
+	"MARCELLA", "ELENA", "KRYSTAL", "ANGELINA", "NADINE", "KARI", "ESTELLE", "DIANNA", "PAULETTE", "LORA",
+	"MONA", "DOREEN", "ROSEMARIE", "ANGEL", "DESIREE", "ANTONIA", "HOPE", "GINGER", "JANIS", "BETSY",
+	"CHRISTIE", "FREDA", "MERCEDES", "MEREDITH", "LYNETTE", "TERI", "CRISTINA", "EULA", "LEIGH", "MEGHAN",
+	"SOPHIA", "ELOISE", "ROCHELLE", "GRETCHEN", "CECELIA", "RAQUEL", "HENRIETTA", "ALYSSA", "JANA", "KELLEY",
+	"GWEN", "KERRY", "JENNA", "TRICIA", "LAVERNE", "OLIVE", "ALEXIS", "TASHA", "SILVIA", "ELVIRA",
+	"CASEY", "DELIA", "SOPHIE", "KATE", "PATTI", "LORENA", "KELLIE", "SONJA", "LILA", "LANA",
+	"DARLA", "MAY", "MINDY", "ESSIE", "MANDY", "LORENE", "ELSA", "JOSEFINA", "JEANNIE", "MIRANDA",
+	"DIXIE", "LUCIA", "MARTA", "FAITH", "LELA", "JOHANNA", "SHARI", "CAMILLE", "TAMI", "SHAWNA",
+	"ELISA", "EBONY", "MELBA", "ORA", "NETTIE", "TABITHA", "OLLIE", "JAIME", "WINIFRED", "KRISTIE",
+	"MARINA", "ALISHA", "AIMEE", "RENA", "MYRNA", "MARLA", "TAMMIE", "LATASHA", "BONITA", "PATRICE",
+	"RONDA", "SHERRIE", "ADDIE", "FRANCINE", "DELORIS", "STACIE", "ADRIANA", "CHERI", "SHELBY", "ABIGAIL",
+	"CELESTE", "JEWEL", "CARA", "ADELE", "REBEKAH", "LUCINDA", "DORTHY", "CHRIS", "EFFIE", "TRINA",
+	"REBA", "SHAWN", "SALLIE", "AURORA", "LENORA", "ETTA", "LOTTIE", "KERRI", "TRISHA", "NIKKI",
+	"ESTELLA", "FRANCISCA", "JOSIE", "TRACIE", "MARISSA", "KARIN", "BRITTNEY", "JANELLE", "LOURDES", "LAUREL",
+	"HELENE", "FERN", "ELVA", "CORINNE", "KELSEY", "INA", "BETTIE", "ELISABETH", "AIDA", "CAITLIN",
+	"INGRID", "IVA", "EUGENIA", "CHRISTA", "GOLDIE", "CASSIE", "MAUDE", "JENIFER", "THERESE", "FRANKIE",
+	"DENA", "LORNA", "JANETTE", "LATONYA", "CANDY", "MORGAN", "CONSUELO", "TAMIKA", "ROSETTA", "DEBORA",
+	"CHERIE", "POLLY", "DINA", "JEWELL", "FAY", "JILLIAN", "DOROTHEA", "NELL", "TRUDY", "ESPERANZA",
+	"PATRICA", "KIMBERLEY", "SHANNA", "HELENA", "CAROLINA", "CLEO", "STEFANIE", "ROSARIO", "OLA", "JANINE",
+	"MOLLIE", "LUPE", "ALISA", "LOU", "MARIBEL", "SUSANNE", "BETTE", "SUSANA", "ELISE", "CECILE",
+	"ISABELLE", "LESLEY", "JOCELYN", "PAIGE", "JONI", "RACHELLE", "LEOLA", "DAPHNE", "ALTA", "ESTER",
+	"PETRA", "GRACIELA", "IMOGENE", "JOLENE", "KEISHA", "LACEY", "GLENNA", "GABRIELA", "KERI", "URSULA",
+	"LIZZIE", "KIRSTEN", "SHANA", "ADELINE", "MAYRA", "JAYNE", "JACLYN", "GRACIE", "SONDRA", "CARMELA",
+	"MARISA", "ROSALIND", "CHARITY", "TONIA", "BEATRIZ", "MARISOL", "CLARICE", "JEANINE", "SHEENA", "ANGELINE",
+	"FRIEDA", "LILY", "ROBBIE", "SHAUNA", "MILLIE", "CLAUDETTE", "CATHLEEN", "ANGELIA", "GABRIELLE", "AUTUMN",
+	"KATHARINE", "SUMMER", "JODIE", "STACI", "LEA", "CHRISTI", "JIMMIE", "JUSTINE", "ELMA", "LUELLA",
+	"MARGRET", "DOMINIQUE", "SOCORRO", "RENE", "MARTINA", "MARGO", "MAVIS", "CALLIE", "BOBBI", "MARITZA",
+	"LUCILE", "LEANNE", "JEANNINE", "DEANA", "AILEEN", "LORIE", "LADONNA", "WILLA", "MANUELA", "GALE",
+	"SELMA", "DOLLY", "SYBIL", "ABBY", "LARA", "DALE", "IVY", "DEE", "WINNIE", "MARCY",
+	"LUISA", "JERI", "MAGDALENA", "OFELIA", "MEAGAN", "AUDRA", "MATILDA", "LEILA", "CORNELIA", "BIANCA",
+	"SIMONE", "BETTYE", "RANDI", "VIRGIE", "LATISHA", "BARBRA", "GEORGINA", "ELIZA", "LEANN", "BRIDGETTE",
+	"RHODA", "HALEY", "ADELA", "NOLA", "BERNADINE", "FLOSSIE", "ILA", "GRETA", "RUTHIE", "NELDA",
+	"MINERVA", "LILLY", "TERRIE", "LETHA", "HILARY", "ESTELA", "VALARIE", "BRIANNA", "ROSALYN", "EARLINE",
+	"CATALINA", "AVA", "MIA", "CLARISSA", "LIDIA", "CORRINE", "ALEXANDRIA", "CONCEPCION", "TIA", "SHARRON",
+	"RAE", "DONA", "ERICKA", "JAMI", "ELNORA", "CHANDRA", "LENORE", "NEVA", "MARYLOU", "MELISA",
+	"TABATHA", "SERENA", "AVIS", "ALLIE", "SOFIA", "JEANIE", "ODESSA", "NANNIE", "HARRIETT", "LORAINE",
+	"PENELOPE", "MILAGROS", "EMILIA", "BENITA", "ALLYSON", "ASHLEE", "TANIA", "TOMMIE", "ESMERALDA", "KARINA",
+	"EVE", "PEARLIE", "ZELMA", "MALINDA", "NOREEN", "TAMEKA", "SAUNDRA", "HILLARY", "AMIE", "ALTHEA",
+	"ROSALINDA", "JORDAN", "LILIA", "ALANA", "GAY", "CLARE", "ALEJANDRA", "ELINOR", "MICHAEL", "LORRIE",
+	"JERRI", "DARCY", "EARNESTINE", "CARMELLA", "TAYLOR", "NOEMI", "MARCIE", "LIZA", "ANNABELLE", "LOUISA",
+	"EARLENE", "MALLORY", "CARLENE", "NITA", "SELENA", "TANISHA", "KATY", "JULIANNE", "JOHN", "LAKISHA",
+	"EDWINA", "MARICELA", "MARGERY", "KENYA", "DOLLIE", "ROXIE", "ROSLYN", "KATHRINE", "NANETTE", "CHARMAINE",
+	"LAVONNE", "ILENE", "KRIS", "TAMMI", "SUZETTE", "CORINE", "KAYE", "JERRY", "MERLE", "CHRYSTAL",
+	"LINA", "DEANNE", "LILIAN", "JULIANA", "ALINE", "LUANN", "KASEY", "MARYANNE", "EVANGELINE", "COLETTE",
+	"MELVA", "LAWANDA", "YESENIA", "NADIA", "MADGE", "KATHIE", "EDDIE", "OPHELIA", "VALERIA", "NONA",
+	"MITZI", "MARI", "GEORGETTE", "CLAUDINE", "FRAN", "ALISSA", "ROSEANN", "LAKEISHA", "SUSANNA", "REVA",
+	"DEIDRE", "CHASITY", "SHEREE", "CARLY", "JAMES", "ELVIA", "ALYCE", "DEIRDRE", "GENA", "BRIANA",
+	"ARACELI", "KATELYN", "ROSANNE", "WENDI", "TESSA", "BERTA", "MARVA", "IMELDA", "MARIETTA", "MARCI",
+	"LEONOR", "ARLINE", "SASHA", "MADELYN", "JANNA", "JULIETTE", "DEENA", "AURELIA", "JOSEFA", "AUGUSTA",
+	"LILIANA", "YOUNG", "CHRISTIAN", "LESSIE", "AMALIA", "SAVANNAH", "ANASTASIA", "VILMA", "NATALIA", "ROSELLA",
+	"LYNNETTE", "CORINA", "ALFREDA", "LEANNA", "CAREY", "AMPARO", "COLEEN", "TAMRA", "AISHA", "WILDA",
+	"KARYN", "CHERRY", "QUEEN", "MAURA", "MAI", "EVANGELINA", "ROSANNA", "HALLIE", "ERNA", "ENID",
+	"MARIANA", "LACY", "JULIET", "JACKLYN", "FREIDA", "MADELEINE", "MARA", "HESTER", "CATHRYN", "LELIA",
+	"CASANDRA", "BRIDGETT", "ANGELITA", "JANNIE", "DIONNE", "ANNMARIE", "KATINA", "BERYL", "PHOEBE", "MILLICENT",
+	"KATHERYN", "DIANN", "CARISSA", "MARYELLEN", "LIZ", "LAURI", "HELGA", "GILDA", "ADRIAN", "RHEA",
+	"MARQUITA", "HOLLIE", "TISHA", "TAMERA", "ANGELIQUE", "FRANCESCA", "BRITNEY", "KAITLIN", "LOLITA", "FLORINE",
+	"ROWENA", "REYNA", "TWILA", "FANNY", "JANELL", "INES", "CONCETTA", "BERTIE", "ALBA", "BRIGITTE",
+	"ALYSON", "VONDA", "PANSY", "ELBA", "NOELLE", "LETITIA", "KITTY", "DEANN", "BRANDIE", "LOUELLA",
+	"LETA", "FELECIA", "SHARLENE", "LESA", "BEVERLEY", "ROBERT", "ISABELLA", "HERMINIA", "TERRA", "CELINA",
+	"TORI", "OCTAVIA", "JADE", "DENICE", "GERMAINE", "SIERRA", "MICHELL", "CORTNEY", "NELLY", "DORETHA",
+	"SYDNEY", "DEIDRA", "MONIKA", "LASHONDA", "JUDI", "CHELSEY", "ANTIONETTE", "MARGOT", "BOBBY", "ADELAIDE",
+	"NAN", "LEEANN", "ELISHA", "DESSIE", "LIBBY", "KATHI", "GAYLA", "LATANYA", "MINA", "MELLISA",
+	"KIMBERLEE", "JASMIN", "RENAE", "ZELDA", "ELDA", "MA", "JUSTINA", "GUSSIE", "EMILIE", "CAMILLA",
+	"ABBIE", "ROCIO", "KAITLYN", "JESSE", "EDYTHE", "ASHLEIGH", "SELINA", "LAKESHA", "GERI", "ALLENE",
+	"PAMALA", "MICHAELA", "DAYNA", "CARYN", "ROSALIA", "SUN", "JACQULINE", "REBECA", "MARYBETH", "KRYSTLE",
+	"IOLA", "DOTTIE", "BENNIE", "BELLE", "AUBREY", "GRISELDA", "ERNESTINA", "ELIDA", "ADRIANNE", "DEMETRIA",
+	"DELMA", "CHONG", "JAQUELINE", "DESTINY", "ARLEEN", "VIRGINA", "RETHA", "FATIMA", "TILLIE", "ELEANORE",
+	"CARI", "TREVA", "BIRDIE", "WILHELMINA", "ROSALEE", "MAURINE", "LATRICE", "YONG", "JENA", "TARYN",
+	"ELIA", "DEBBY", "MAUDIE", "JEANNA", "DELILAH", "CATRINA", "SHONDA", "HORTENCIA", "THEODORA", "TERESITA",
+	"ROBBIN", "DANETTE", "MARYJANE", "FREDDIE", "DELPHINE", "BRIANNE", "NILDA", "DANNA", "CINDI", "BESS",
+	"IONA", "HANNA", "ARIEL", "WINONA", "VIDA", "ROSITA", "MARIANNA", "WILLIAM", "RACHEAL", "GUILLERMINA",
+	"ELOISA", "CELESTINE", "CAREN", "MALISSA", "LONA", "CHANTEL", "SHELLIE", "MARISELA", "LEORA", "AGATHA",
+	"SOLEDAD", "MIGDALIA", "IVETTE", "CHRISTEN", "ATHENA", "JANEL", "CHLOE", "VEDA", "PATTIE", "TESSIE",
+	"TERA", "MARILYNN", "LUCRETIA", "KARRIE", "DINAH", "DANIELA", "ALECIA", "ADELINA", "VERNICE", "SHIELA",
+	"PORTIA", "MERRY", "LASHAWN", "DEVON", "DARA", "TAWANA", "OMA", "VERDA", "CHRISTIN", "ALENE",
+	"ZELLA", "SANDI", "RAFAELA", "MAYA", "KIRA", "CANDIDA", "ALVINA", "SUZAN", "SHAYLA", "LYN",
+	"LETTIE", "ALVA", "SAMATHA", "ORALIA", "MATILDE", "MADONNA", "LARISSA", "VESTA", "RENITA", "INDIA",
+	"DELOIS", "SHANDA", "PHILLIS", "LORRI", "ERLINDA", "CRUZ", "CATHRINE", "BARB", "ZOE", "ISABELL",
+	"IONE", "GISELA", "CHARLIE", "VALENCIA", "ROXANNA", "MAYME", "KISHA", "ELLIE", "MELLISSA", "DORRIS",
+	"DALIA", "BELLA", "ANNETTA", "ZOILA", "RETA", "REINA", "LAURETTA", "KYLIE", "CHRISTAL", "PILAR",
+	"CHARLA", "ELISSA", "TIFFANI", "TANA", "PAULINA", "LEOTA", "BREANNA", "JAYME", "CARMEL", "VERNELL",
+	"TOMASA", "MANDI", "DOMINGA", "SANTA", "MELODIE", "LURA", "ALEXA", "TAMELA", "RYAN", "MIRNA",
+	"KERRIE", "VENUS", "NOEL", "FELICITA", "CRISTY", "CARMELITA", "BERNIECE", "ANNEMARIE", "TIARA", "ROSEANNE",
+	"MISSY", "CORI", "ROXANA", "PRICILLA", "KRISTAL", "JUNG", "ELYSE", "HAYDEE", "ALETHA", "BETTINA",
+	"MARGE", "GILLIAN", "FILOMENA", "CHARLES", "ZENAIDA", "HARRIETTE", "CARIDAD", "VADA", "UNA", "ARETHA",
+	"PEARLINE", "MARJORY", "MARCELA", "FLOR", "EVETTE", "ELOUISE", "ALINA", "TRINIDAD", "DAVID", "DAMARIS",
+	"CATHARINE", "CARROLL", "BELVA", "NAKIA", "MARLENA", "LUANNE", "LORINE", "KARON", "DORENE", "DANITA",
+	"BRENNA", "TATIANA", "SAMMIE", "LOUANN", "LOREN", "JULIANNA", "ANDRIA", "PHILOMENA", "LUCILA", "LEONORA",
+	"DOVIE", "ROMONA", "MIMI", "JACQUELIN", "GAYE", "TONJA", "MISTI", "JOE", "GENE", "CHASTITY",
+	"STACIA", "ROXANN", "MICAELA", "NIKITA", "MEI", "VELDA", "MARLYS", "JOHNNA", "AURA", "LAVERN",
+	"IVONNE", "HAYLEY", "NICKI", "MAJORIE", "HERLINDA", "GEORGE", "ALPHA", "YADIRA", "PERLA", "GREGORIA",
+	"DANIEL", "ANTONETTE", "SHELLI", "MOZELLE", "MARIAH", "JOELLE", "CORDELIA", "JOSETTE", "CHIQUITA", "TRISTA",
+	"LOUIS", "LAQUITA", "GEORGIANA", "CANDI", "SHANON", "LONNIE", "HILDEGARD", "CECIL", "VALENTINA", "STEPHANY",
+	"MAGDA", "KAROL", "GERRY", "GABRIELLA", "TIANA", "ROMA", "RICHELLE", "RAY", "PRINCESS", "OLETA",
+	"JACQUE", "IDELLA", "ALAINA", "SUZANNA", "JOVITA", "BLAIR", "TOSHA", "RAVEN", "NEREIDA", "MARLYN",
+	"KYLA", "JOSEPH", "DELFINA", "TENA", "STEPHENIE", "SABINA", "NATHALIE", "MARCELLE", "GERTIE", "DARLEEN",
+	"THEA", "SHARONDA", "SHANTEL", "BELEN", "VENESSA", "ROSALINA", "ONA", "GENOVEVA", "COREY", "CLEMENTINE",
+	"ROSALBA", "RENATE", "RENATA", "MI", "IVORY", "GEORGIANNA", "FLOY", "DORCAS", "ARIANA", "TYRA",
+	"THEDA", "MARIAM", "JULI", "JESICA", "DONNIE", "VIKKI", "VERLA", "ROSELYN", "MELVINA", "JANNETTE",
+	"GINNY", "DEBRAH", "CORRIE", "ASIA", "VIOLETA", "MYRTIS", "LATRICIA", "COLLETTE", "CHARLEEN", "ANISSA",
+	"VIVIANA", "TWYLA", "PRECIOUS", "NEDRA", "LATONIA", "LAN", "HELLEN", "FABIOLA", "ANNAMARIE", "ADELL",
+	"SHARYN", "CHANTAL", "NIKI", "MAUD", "LIZETTE", "LINDY", "KIA", "KESHA", "JEANA", "DANELLE",
+	"CHARLINE", "CHANEL", "CARROL", "VALORIE", "LIA", "DORTHA", "CRISTAL", "SUNNY", "LEONE", "LEILANI",
+	"GERRI", "DEBI", "ANDRA", "KESHIA", "IMA", "EULALIA", "EASTER", "DULCE", "NATIVIDAD", "LINNIE",
+	"KAMI", "GEORGIE", "CATINA", "BROOK", "ALDA", "WINNIFRED", "SHARLA", "RUTHANN", "MEAGHAN", "MAGDALENE",
+	"LISSETTE", "ADELAIDA", "VENITA", "TRENA", "SHIRLENE", "SHAMEKA", "ELIZEBETH", "DIAN", "SHANTA", "MICKEY",
+	"LATOSHA", "CARLOTTA", "WINDY", "SOON", "ROSINA", "MARIANN", "LEISA", "JONNIE", "DAWNA", "CATHIE",
+	"BILLY", "ASTRID", "SIDNEY", "LAUREEN", "JANEEN", "HOLLI", "FAWN", "VICKEY", "TERESSA", "SHANTE",
+	"RUBYE", "MARCELINA", "CHANDA", "CARY", "TERESE", "SCARLETT", "MARTY", "MARNIE", "LULU", "LISETTE",
+	"JENIFFER", "ELENOR", "DORINDA", "DONITA", "CARMAN", "BERNITA", "ALTAGRACIA", "ALETA", "ADRIANNA", "ZORAIDA",
+	"RONNIE", "NICOLA", "LYNDSEY", "KENDALL", "JANINA", "CHRISSY", "AMI", "STARLA", "PHYLIS", "PHUONG",
+	"KYRA", "CHARISSE", "BLANCH", "SANJUANITA", "RONA", "NANCI", "MARILEE", "MARANDA", "CORY", "BRIGETTE",
+	"SANJUANA", "MARITA", "KASSANDRA", "JOYCELYN", "IRA", "FELIPA", "CHELSIE", "BONNY", "MIREYA", "LORENZA",
+	"KYONG", "ILEANA", "CANDELARIA", "TONY", "TOBY", "SHERIE", "OK", "MARK", "LUCIE", "LEATRICE",
+	"LAKESHIA", "GERDA", "EDIE", "BAMBI", "MARYLIN", "LAVON", "HORTENSE", "GARNET", "EVIE", "TRESSA",
+	"SHAYNA", "LAVINA", "KYUNG", "JEANETTA", "SHERRILL", "SHARA", "PHYLISS", "MITTIE", "ANABEL", "ALESIA",
+	"THUY", "TAWANDA", "RICHARD", "JOANIE", "TIFFANIE", "LASHANDA", "KARISSA", "ENRIQUETA", "DARIA", "DANIELLA",
+	"CORINNA", "ALANNA", "ABBEY", "ROXANE", "ROSEANNA", "MAGNOLIA", "LIDA", "KYLE", "JOELLEN", "ERA",
+	"CORAL", "CARLEEN", "TRESA", "PEGGIE", "NOVELLA", "NILA", "MAYBELLE", "JENELLE", "CARINA", "NOVA",
+	"MELINA", "MARQUERITE", "MARGARETTE", "JOSEPHINA", "EVONNE", "DEVIN", "CINTHIA", "ALBINA", "TOYA", "TAWNYA",
+	"SHERITA", "SANTOS", "MYRIAM", "LIZABETH", "LISE", "KEELY", "JENNI", "GISELLE", "CHERYLE", "ARDITH",
+	"ARDIS", "ALESHA", "ADRIANE", "SHAINA", "LINNEA", "KAROLYN", "HONG", "FLORIDA", "FELISHA", "DORI",
+	"DARCI", "ARTIE", "ARMIDA", "ZOLA", "XIOMARA", "VERGIE", "SHAMIKA", "NENA", "NANNETTE", "MAXIE",
+	"LOVIE", "JEANE", "JAIMIE", "INGE", "FARRAH", "ELAINA", "CAITLYN", "STARR", "FELICITAS", "CHERLY",
+	"CARYL", "YOLONDA", "YASMIN", "TEENA", "PRUDENCE", "PENNIE", "NYDIA", "MACKENZIE", "ORPHA", "MARVEL",
+	"LIZBETH", "LAURETTE", "JERRIE", "HERMELINDA", "CAROLEE", "TIERRA", "MIRIAN", "META", "MELONY", "KORI",
+	"JENNETTE", "JAMILA", "ENA", "ANH", "YOSHIKO", "SUSANNAH", "SALINA", "RHIANNON", "JOLEEN", "CRISTINE",
+	"ASHTON", "ARACELY", "TOMEKA", "SHALONDA", "MARTI", "LACIE", "KALA", "JADA", "ILSE", "HAILEY",
+	"BRITTANI", "ZONA", "SYBLE", "SHERRYL", "RANDY", "NIDIA", "MARLO", "KANDICE", "KANDI", "DEB",
+	"DEAN", "AMERICA", "ALYCIA", "TOMMY", "RONNA", "NORENE", "MERCY", "JOSE", "INGEBORG", "GIOVANNA",
+	"GEMMA", "CHRISTEL", "AUDRY", "ZORA", "VITA", "VAN", "TRISH", "STEPHAINE", "SHIRLEE", "SHANIKA",
+	"MELONIE", "MAZIE", "JAZMIN", "INGA", "HOA", "HETTIE", "GERALYN", "FONDA", "ESTRELLA", "ADELLA",
+	"SU", "SARITA", "RINA", "MILISSA", "MARIBETH", "GOLDA", "EVON", "ETHELYN", "ENEDINA", "CHERISE",
+	"CHANA", "VELVA", "TAWANNA", "SADE", "MIRTA", "LI", "KARIE", "JACINTA", "ELNA", "DAVINA",
+	"CIERRA", "ASHLIE", "ALBERTHA", "TANESHA", "STEPHANI", "NELLE", "MINDI", "LU", "LORINDA", "LARUE",
+	"FLORENE", "DEMETRA", "DEDRA", "CIARA", "CHANTELLE", "ASHLY", "SUZY", "ROSALVA", "NOELIA", "LYDA",
+	"LEATHA", "KRYSTYNA", "KRISTAN", "KARRI", "DARLINE", "DARCIE", "CINDA", "CHEYENNE", "CHERRIE", "AWILDA",
+	"ALMEDA", "ROLANDA", "LANETTE", "JERILYN", "GISELE", "EVALYN", "CYNDI", "CLETA", "CARIN", "ZINA",
+	"ZENA", "VELIA", "TANIKA", "PAUL", "CHARISSA", "THOMAS", "TALIA", "MARGARETE", "LAVONDA", "KAYLEE",
+	"KATHLENE", "JONNA", "IRENA", "ILONA", "IDALIA", "CANDIS", "CANDANCE", "BRANDEE", "ANITRA", "ALIDA",
+	"SIGRID", "NICOLETTE", "MARYJO", "LINETTE", "HEDWIG", "CHRISTIANA", "CASSIDY", "ALEXIA", "TRESSIE", "MODESTA",
+	"LUPITA", "LITA", "GLADIS", "EVELIA", "DAVIDA", "CHERRI", "CECILY", "ASHELY", "ANNABEL", "AGUSTINA",
+	"WANITA", "SHIRLY", "ROSAURA", "HULDA", "EUN", "BAILEY", "YETTA", "VERONA", "THOMASINA", "SIBYL",
+	"SHANNAN", "MECHELLE", "LUE", "LEANDRA", "LANI", "KYLEE", "KANDY", "JOLYNN", "FERNE", "EBONI",
+	"CORENE", "ALYSIA", "ZULA", "NADA", "MOIRA", "LYNDSAY", "LORRETTA", "JUAN", "JAMMIE", "HORTENSIA",
+	"GAYNELL", "CAMERON", "ADRIA", "VINA", "VICENTA", "TANGELA", "STEPHINE", "NORINE", "NELLA", "LIANA",
+	"LESLEE", "KIMBERELY", "ILIANA", "GLORY", "FELICA", "EMOGENE", "ELFRIEDE", "EDEN", "EARTHA", "CARMA",
+	"BEA", "OCIE", "MARRY", "LENNIE", "KIARA", "JACALYN", "CARLOTA", "ARIELLE", "YU", "STAR",
+	"OTILIA", "KIRSTIN", "KACEY", "JOHNETTA", "JOEY", "JOETTA", "JERALDINE", "JAUNITA", "ELANA", "DORTHEA",
+	"CAMI", "AMADA", "ADELIA", "VERNITA", "TAMAR", "SIOBHAN", "RENEA", "RASHIDA", "OUIDA", "ODELL",
+	"NILSA", "MERYL", "KRISTYN", "JULIETA", "DANICA", "BREANNE", "AUREA", "ANGLEA", "SHERRON", "ODETTE",
+	"MALIA", "LORELEI", "LIN", "LEESA", "KENNA", "KATHLYN", "FIONA", "CHARLETTE", "SUZIE", "SHANTELL",
+	"SABRA", "RACQUEL", "MYONG", "MIRA", "MARTINE", "LUCIENNE", "LAVADA", "JULIANN", "JOHNIE", "ELVERA",
+	"DELPHIA", "CLAIR", "CHRISTIANE", "CHAROLETTE", "CARRI", "AUGUSTINE", "ASHA", "ANGELLA", "PAOLA", "NINFA",
+	"LEDA", "LAI", "EDA", "SUNSHINE", "STEFANI", "SHANELL", "PALMA", "MACHELLE", "LISSA", "KECIA",
+	"KATHRYNE", "KARLENE", "JULISSA", "JETTIE", "JENNIFFER", "HUI", "CORRINA", "CHRISTOPHER", "CAROLANN", "ALENA",
+	"TESS", "ROSARIA", "MYRTICE", "MARYLEE", "LIANE", "KENYATTA", "JUDIE", "JANEY", "IN", "ELMIRA",
+	"ELDORA", "DENNA", "CRISTI", "CATHI", "ZAIDA", "VONNIE", "VIVA", "VERNIE", "ROSALINE", "MARIELA",
+	"LUCIANA", "LESLI", "KARAN", "FELICE", "DENEEN", "ADINA", "WYNONA", "TARSHA", "SHERON", "SHASTA",
+	"SHANITA", "SHANI", "SHANDRA", "RANDA", "PINKIE", "PARIS", "NELIDA", "MARILOU", "LYLA", "LAURENE",
+	"LACI", "JOI", "JANENE", "DOROTHA", "DANIELE", "DANI", "CAROLYNN", "CARLYN", "BERENICE", "AYESHA",
+	"ANNELIESE", "ALETHEA", "THERSA", "TAMIKO", "RUFINA", "OLIVA", "MOZELL", "MARYLYN", "MADISON", "KRISTIAN",
+	"KATHYRN", "KASANDRA", "KANDACE", "JANAE", "GABRIEL", "DOMENICA", "DEBBRA", "DANNIELLE", "CHUN", "BUFFY",
+	"BARBIE", "ARCELIA", "AJA", "ZENOBIA", "SHAREN", "SHAREE", "PATRICK", "PAGE", "MY", "LAVINIA",
+	"KUM", "KACIE", "JACKELINE", "HUONG", "FELISA", "EMELIA", "ELEANORA", "CYTHIA", "CRISTIN", "CLYDE",
+	"CLARIBEL", "CARON", "ANASTACIA", "ZULMA", "ZANDRA", "YOKO", "TENISHA", "SUSANN", "SHERILYN", "SHAY",
+	"SHAWANDA", "SABINE", "ROMANA", "MATHILDA", "LINSEY", "KEIKO", "JOANA", "ISELA", "GRETTA", "GEORGETTA",
+	"EUGENIE", "DUSTY", "DESIRAE", "DELORA", "CORAZON", "ANTONINA", "ANIKA", "WILLENE", "TRACEE", "TAMATHA",
+	"REGAN", "NICHELLE", "MICKIE", "MAEGAN", "LUANA", "LANITA", "KELSIE", "EDELMIRA", "BREE", "AFTON",
+	"TEODORA", "TAMIE", "SHENA", "MEG", "LINH", "KELI", "KACI", "DANYELLE", "BRITT", "ARLETTE",
+	"ALBERTINE", "ADELLE", "TIFFINY", "STORMY", "SIMONA", "NUMBERS", "NICOLASA", "NICHOL", "NIA", "NAKISHA",
+	"MEE", "MAIRA", "LOREEN", "KIZZY", "JOHNNY", "JAY", "FALLON", "CHRISTENE", "BOBBYE", "ANTHONY",
+	"YING", "VINCENZA", "TANJA", "RUBIE", "RONI", "QUEENIE", "MARGARETT", "KIMBERLI", "IRMGARD", "IDELL",
+	"HILMA", "EVELINA", "ESTA", "EMILEE", "DENNISE", "DANIA", "CARL", "CARIE", "ANTONIO", "WAI",
+	"SANG", "RISA", "RIKKI", "PARTICIA", "MUI", "MASAKO", "MARIO", "LUVENIA", "LOREE", "LONI",
+	"LIEN", "KEVIN", "GIGI", "FLORENCIA", "DORIAN", "DENITA", "DALLAS", "CHI", "BILLYE", "ALEXANDER",
+	"TOMIKA", "SHARITA", "RANA", "NIKOLE", "NEOMA", "MARGARITE", "MADALYN", "LUCINA", "LAILA", "KALI",
+	"JENETTE", "GABRIELE", "EVELYNE", "ELENORA", "CLEMENTINA", "ALEJANDRINA", "ZULEMA", "VIOLETTE", "VANNESSA", "THRESA",
+	"RETTA", "PIA", "PATIENCE", "NOELLA", "NICKIE", "JONELL", "DELTA", "CHUNG", "CHAYA", "CAMELIA",
+	"BETHEL", "ANYA", "ANDREW", "THANH", "SUZANN", "SPRING", "SHU", "MILA", "LILLA", "LAVERNA",
+	"KEESHA", "KATTIE", "GIA", "GEORGENE", "EVELINE", "ESTELL", "ELIZBETH", "VIVIENNE", "VALLIE", "TRUDIE",
+	"STEPHANE", "MICHEL", "MAGALY", "MADIE", "KENYETTA", "KARREN", "JANETTA", "HERMINE", "HARMONY", "DRUCILLA",
+	"DEBBI", "CELESTINA", "CANDIE", "BRITNI", "BECKIE", "AMINA", "ZITA", "YUN", "YOLANDE", "VIVIEN",
+	"VERNETTA", "TRUDI", "SOMMER", "PEARLE", "PATRINA", "OSSIE", "NICOLLE", "LOYCE", "LETTY", "LARISA",
+	"KATHARINA", "JOSELYN", "JONELLE", "JENELL", "IESHA", "HEIDE", "FLORINDA", "FLORENTINA", "FLO", "ELODIA",
+	"DORINE", "BRUNILDA", "BRIGID", "ASHLI", "ARDELLA", "TWANA", "THU", "TARAH", "SUNG", "SHEA",
+	"SHAVON", "SHANE", "SERINA", "RAYNA", "RAMONITA", "NGA", "MARGURITE", "LUCRECIA", "KOURTNEY", "KATI",
+	"JESUS", "JESENIA", "DIAMOND", "CRISTA", "AYANA", "ALICA", "ALIA", "VINNIE", "SUELLEN", "ROMELIA",
+	"RACHELL", "PIPER", "OLYMPIA", "MICHIKO", "KATHALEEN", "JOLIE", "JESSI", "JANESSA", "HANA", "HA",
+	"ELEASE", "CARLETTA", "BRITANY", "SHONA", "SALOME", "ROSAMOND", "REGENA", "RAINA", "NGOC", "NELIA",
+	"LOUVENIA", "LESIA", "LATRINA", "LATICIA", "LARHONDA", "JINA", "JACKI", "HOLLIS", "HOLLEY", "EMMY",
+	"DEEANN", "CORETTA", "ARNETTA", "VELVET", "THALIA", "SHANICE", "NETA", "MIKKI", "MICKI", "LONNA",
+	"LEANA", "LASHUNDA", "KILEY", "JOYE", "JACQULYN", "IGNACIA", "HYUN", "HIROKO", "HENRY", "HENRIETTE",
+	"ELAYNE", "DELINDA", "DARNELL", "DAHLIA", "COREEN", "CONSUELA", "CONCHITA", "CELINE", "BABETTE", "AYANNA",
+	"ANETTE", "ALBERTINA", "SKYE", "SHAWNEE", "SHANEKA", "QUIANA", "PAMELIA", "MIN", "MERRI", "MERLENE",
+	"MARGIT", "KIESHA", "KIERA", "KAYLENE", "JODEE", "JENISE", "ERLENE", "EMMIE", "ELSE", "DARYL",
+	"DALILA", "DAISEY", "CODY", "CASIE", "BELIA", "BABARA", "VERSIE", "VANESA", "SHELBA", "SHAWNDA",
+	"SAM", "NORMAN", "NIKIA", "NAOMA", "MARNA", "MARGERET", "MADALINE", "LAWANA", "KINDRA", "JUTTA",
+	"JAZMINE", "JANETT", "HANNELORE", "GLENDORA", "GERTRUD", "GARNETT", "FREEDA", "FREDERICA", "FLORANCE", "FLAVIA",
+	"DENNIS", "CARLINE", "BEVERLEE", "ANJANETTE", "VALDA", "TRINITY", "TAMALA", "STEVIE", "SHONNA", "SHA",
+	"SARINA", "ONEIDA", "MICAH", "MERILYN", "MARLEEN", "LURLINE", "LENNA", "KATHERIN", "JIN", "JENI",
+	"HAE", "GRACIA", "GLADY", "FARAH", "ERIC", "ENOLA", "EMA", "DOMINQUE", "DEVONA", "DELANA",
+	"CECILA", "CAPRICE", "ALYSHA", "ALI", "ALETHIA", "VENA", "THERESIA", "TAWNY", "SONG", "SHAKIRA",
+	"SAMARA", "SACHIKO", "RACHELE", "PAMELLA", "NICKY", "MARNI", "MARIEL", "MAREN", "MALISA", "LIGIA",
+	"LERA", "LATORIA", "LARAE", "KIMBER", "KATHERN", "KAREY", "JENNEFER", "JANETH", "HALINA", "FREDIA",
+	"DELISA", "DEBROAH", "CIERA", "CHIN", "ANGELIKA", "ANDREE", "ALTHA", "YEN", "VIVAN", "TERRESA",
+	"TANNA", "SUK", "SUDIE", "SOO", "SIGNE", "SALENA", "RONNI", "REBBECCA", "MYRTIE", "MCKENZIE",
+	"MALIKA", "MAIDA", "LOAN", "LEONARDA", "KAYLEIGH", "FRANCE", "ETHYL", "ELLYN", "DAYLE", "CAMMIE",
+	"BRITTNI", "BIRGIT", "AVELINA", "ASUNCION", "ARIANNA", "AKIKO", "VENICE", "TYESHA", "TONIE", "TIESHA",
+	"TAKISHA", "STEFFANIE", "SINDY", "SANTANA", "MEGHANN", "MANDA", "MACIE", "LADY", "KELLYE", "KELLEE",
+	"JOSLYN", "JASON", "INGER", "INDIRA", "GLINDA", "GLENNIS", "FERNANDA", "FAUSTINA", "ENEIDA", "ELICIA",
+	"DOT", "DIGNA", "DELL", "ARLETTA", "ANDRE", "WILLIA", "TAMMARA", "TABETHA", "SHERRELL", "SARI",
+	"REFUGIO", "REBBECA", "PAULETTA", "NIEVES", "NATOSHA", "NAKITA", "MAMMIE", "KENISHA", "KAZUKO", "KASSIE",
+	"GARY", "EARLEAN", "DAPHINE", "CORLISS", "CLOTILDE", "CAROLYNE", "BERNETTA", "AUGUSTINA", "AUDREA", "ANNIS",
+	"ANNABELL", "YAN", "TENNILLE", "TAMICA", "SELENE", "SEAN", "ROSANA", "REGENIA", "QIANA", "MARKITA",
+	"MACY", "LEEANNE", "LAURINE", "KYM", "JESSENIA", "JANITA", "GEORGINE", "GENIE", "EMIKO", "ELVIE",
+	"DEANDRA", "DAGMAR", "CORIE", "COLLEN", "CHERISH", "ROMAINE", "PORSHA", "PEARLENE", "MICHELINE", "MERNA",
+	"MARGORIE", "MARGARETTA", "LORE", "KENNETH", "JENINE", "HERMINA", "FREDERICKA", "ELKE", "DRUSILLA", "DORATHY",
+	"DIONE", "DESIRE", "CELENA", "BRIGIDA", "ANGELES", "ALLEGRA", "THEO", "TAMEKIA", "SYNTHIA", "STEPHEN",
+	"SOOK", "SLYVIA", "ROSANN", "REATHA", "RAYE", "MARQUETTA", "MARGART", "LING", "LAYLA", "KYMBERLY",
+	"KIANA", "KAYLEEN", "KATLYN", "KARMEN", "JOELLA", "IRINA", "EMELDA", "ELENI", "DETRA", "CLEMMIE",
+	"CHERYLL", "CHANTELL", "CATHEY", "ARNITA", "ARLA", "ANGLE", "ANGELIC", "ALYSE", "ZOFIA", "THOMASINE",
+	"TENNIE", "SON", "SHERLY", "SHERLEY", "SHARYL", "REMEDIOS", "PETRINA", "NICKOLE", "MYUNG", "MYRLE",
+	"MOZELLA", "LOUANNE", "LISHA", "LATIA", "LANE", "KRYSTA", "JULIENNE", "JOEL", "JEANENE", "JACQUALINE",
+	"ISAURA", "GWENDA", "EARLEEN", "DONALD", "CLEOPATRA", "CARLIE", "AUDIE", "ANTONIETTA", "ALISE", "ALEX",
+	"VERDELL", "VAL", "TYLER", "TOMOKO", "THAO", "TALISHA", "STEVEN", "SO", "SHEMIKA", "SHAUN",
+	"SCARLET", "SAVANNA", "SANTINA", "ROSIA", "RAEANN", "ODILIA", "NANA", "MINNA", "MAGAN", "LYNELLE",
+	"LE", "KARMA", "JOEANN", "IVANA", "INELL", "ILANA", "HYE", "HONEY", "HEE", "GUDRUN",
+	"FRANK", "DREAMA", "CRISSY", "CHANTE", "CARMELINA", "ARVILLA", "ARTHUR", "ANNAMAE", "ALVERA", "ALEIDA",
+	"AARON", "YEE", "YANIRA", "VANDA", "TIANNA", "TAM", "STEFANIA", "SHIRA", "PERRY", "NICOL",
+	"NANCIE", "MONSERRATE", "MINH", "MELYNDA", "MELANY", "MATTHEW", "LOVELLA", "LAURE", "KIRBY", "KACY",
+	"JACQUELYNN", "HYON", "GERTHA", "FRANCISCO", "ELIANA", "CHRISTENA", "CHRISTEEN", "CHARISE", "CATERINA", "CARLEY",
+	"CANDYCE", "ARLENA", "AMMIE", "YANG", "WILLETTE", "VANITA", "TUYET", "TINY", "SYREETA", "SILVA",
+	"SCOTT", "RONALD", "PENNEY", "NYLA", "MICHAL", "MAURICE", "MARYAM", "MARYA", "MAGEN", "LUDIE",
+	"LOMA", "LIVIA", "LANELL", "KIMBERLIE", "JULEE", "DONETTA", "DIEDRA", "DENISHA", "DEANE", "DAWNE",
+	"CLARINE", "CHERRYL", "BRONWYN", "BRANDON", "ALLA", "VALERY", "TONDA", "SUEANN", "SORAYA", "SHOSHANA",
+	"SHELA", "SHARLEEN", "SHANELLE", "NERISSA", "MICHEAL", "MERIDITH", "MELLIE", "MAYE", "MAPLE", "MAGARET",
+	"LUIS", "LILI", "LEONILA", "LEONIE", "LEEANNA", "LAVONIA", "LAVERA", "KRISTEL", "KATHEY", "KATHE",
+	"JUSTIN", "JULIAN", "JIMMY", "JANN", "ILDA", "HILDRED", "HILDEGARDE", "GENIA", "FUMIKO", "EVELIN",
+	"ERMELINDA", "ELLY", "DUNG", "DOLORIS", "DIONNA", "DANAE", "BERNEICE", "ANNICE", "ALIX", "VERENA",
+	"VERDIE", "TRISTAN", "SHAWNNA", "SHAWANA", "SHAUNNA", "ROZELLA", "RANDEE", "RANAE", "MILAGRO", "LYNELL",
+	"LUISE", "LOUIE", "LOIDA", "LISBETH", "KARLEEN", "JUNITA", "JONA", "ISIS", "HYACINTH", "HEDY",
+	"GWENN", "ETHELENE", "ERLINE", "EDWARD", "DONYA", "DOMONIQUE", "DELICIA", "DANNETTE", "CICELY", "BRANDA",
+	"BLYTHE", "BETHANN", "ASHLYN", "ANNALEE", "ALLINE", "YUKO", "VELLA", "TRANG", "TOWANDA", "TESHA",
+	"SHERLYN", "NARCISA", "MIGUELINA", "MERI", "MAYBELL", "MARLANA", "MARGUERITA", "MADLYN", "LUNA", "LORY",
+	"LORIANN", "LIBERTY", "LEONORE", "LEIGHANN", "LAURICE", "LATESHA", "LARONDA", "KATRICE", "KASIE", "KARL",
+	"KALEY", "JADWIGA", "GLENNIE", "GEARLDINE", "FRANCINA", "EPIFANIA", "DYAN", "DORIE", "DIEDRE", "DENESE",
+	"DEMETRICE", "DELENA", "DARBY", "CRISTIE", "CLEORA", "CATARINA", "CARISA", "BERNIE", "BARBERA", "ALMETA",
+	"TRULA", "TEREASA", "SOLANGE", "SHEILAH", "SHAVONNE", "SANORA", "ROCHELL", "MATHILDE", "MARGARETA", "MAIA",
+	"LYNSEY", "LAWANNA", "LAUNA", "KENA", "KEENA", "KATIA", "JAMEY", "GLYNDA", "GAYLENE", "ELVINA",
+	"ELANOR", "DANUTA", "DANIKA", "CRISTEN", "CORDIE", "COLETTA", "CLARITA", "CARMON", "BRYNN", "AZUCENA",
+	"AUNDREA", "ANGELE", "YI", "WALTER", "VERLIE", "VERLENE", "TAMESHA", "SILVANA", "SEBRINA", "SAMIRA",
+	"REDA", "RAYLENE", "PENNI", "PANDORA", "NORAH", "NOMA", "MIREILLE", "MELISSIA", "MARYALICE", "LARAINE",
+	"KIMBERY", "KARYL", "KARINE", "KAM", "JOLANDA", "JOHANA", "JESUSA", "JALEESA", "JAE", "JACQUELYNE",
+	"IRISH", "ILUMINADA", "HILARIA", "HANH", "GENNIE", "FRANCIE", "FLORETTA", "EXIE", "EDDA", "DREMA",
+	"DELPHA", "BEV", "BARBAR", "ASSUNTA", "ARDELL", "ANNALISA", "ALISIA", "YUKIKO", "YOLANDO", "WONDA",
+	"WEI", "WALTRAUD", "VETA", "TEQUILA", "TEMEKA", "TAMEIKA", "SHIRLEEN", "SHENITA", "PIEDAD", "OZELLA",
+	"MIRTHA", "MARILU", "KIMIKO", "JULIANE", "JENICE", "JEN", "JANAY", "JACQUILINE", "HILDE", "FE",
+	"FAE", "EVAN", "EUGENE", "ELOIS", "ECHO", "DEVORAH", "CHAU", "BRINDA", "BETSEY", "ARMINDA",
+	"ARACELIS", "APRYL", "ANNETT", "ALISHIA", "VEOLA", "USHA", "TOSHIKO", "THEOLA", "TASHIA", "TALITHA",
+	"SHERY", "RUDY", "RENETTA", "REIKO", "RASHEEDA", "OMEGA", "OBDULIA", "MIKA", "MELAINE", "MEGGAN",
+	"MARTIN", "MARLEN", "MARGET", "MARCELINE", "MANA", "MAGDALEN", "LIBRADA", "LEZLIE", "LEXIE", "LATASHIA",
+	"LASANDRA", "KELLE", "ISIDRA", "ISA", "INOCENCIA", "GWYN", "FRANCOISE", "ERMINIA", "ERINN", "DIMPLE",
+	"DEVORA", "CRISELDA", "ARMANDA", "ARIE", "ARIANE", "ANGELO", "ANGELENA", "ALLEN", "ALIZA", "ADRIENE",
+	"ADALINE", "XOCHITL", "TWANNA", "TRAN", "TOMIKO", "TAMISHA", "TAISHA", "SUSY", "SIU", "RUTHA",
+	"ROXY", "RHONA", "RAYMOND", "OTHA", "NORIKO", "NATASHIA", "MERRIE", "MELVIN", "MARINDA", "MARIKO",
+	"MARGERT", "LORIS", "LIZZETTE", "LEISHA", "KAILA", "KA", "JOANNIE", "JERRICA", "JENE", "JANNET",
+	"JANEE", "JACINDA", "HERTA", "ELENORE", "DORETTA", "DELAINE", "DANIELL", "CLAUDIE", "CHINA", "BRITTA",
+	"APOLONIA", "AMBERLY", "ALEASE", "YURI", "YUK", "WEN", "WANETA", "UTE", "TOMI", "SHARRI",
+	"SANDIE", "ROSELLE", "REYNALDA", "RAGUEL", "PHYLICIA", "PATRIA", "OLIMPIA", "ODELIA", "MITZIE", "MITCHELL",
+	"MISS", "MINDA", "MIGNON", "MICA", "MENDY", "MARIVEL", "MAILE", "LYNETTA", "LAVETTE", "LAURYN",
+	"LATRISHA", "LAKIESHA", "KIERSTEN", "KARY", "JOSPHINE", "JOLYN", "JETTA", "JANISE", "JACQUIE", "IVELISSE",
+	"GLYNIS", "GIANNA", "GAYNELLE", "EMERALD", "DEMETRIUS", "DANYELL", "DANILLE", "DACIA", "CORALEE", "CHER",
+	"CEOLA", "BRETT", "BELL", "ARIANNE", "ALESHIA", "YUNG", "WILLIEMAE", "TROY", "TRINH", "THORA",
+	"TAI", "SVETLANA", "SHERIKA", "SHEMEKA", "SHAUNDA", "ROSELINE", "RICKI", "MELDA", "MALLIE", "LAVONNA",
+	"LATINA", "LARRY", "LAQUANDA", "LALA", "LACHELLE", "KLARA", "KANDIS", "JOHNA", "JEANMARIE", "JAYE",
+	"HANG", "GRAYCE", "GERTUDE", "EMERITA", "EBONIE", "CLORINDA", "CHING", "CHERY", "CAROLA", "BREANN",
+	"BLOSSOM", "BERNARDINE", "BECKI", "ARLETHA", "ARGELIA", "ARA", "ALITA", "YULANDA", "YON", "YESSENIA",
+	"TOBI", "TASIA", "SYLVIE", "SHIRL", "SHIRELY", "SHERIDAN", "SHELLA", "SHANTELLE", "SACHA", "ROYCE",
+	"REBECKA", "REAGAN", "PROVIDENCIA", "PAULENE", "MISHA", "MIKI", "MARLINE", "MARICA", "LORITA", "LATOYIA",
+	"LASONYA", "KERSTIN", "KENDA", "KEITHA", "KATHRIN", "JAYMIE", "JACK", "GRICELDA", "GINETTE", "ERYN",
+	"ELINA", "ELFRIEDA", "DANYEL", "CHEREE", "CHANELLE", "BARRIE", "AVERY", "AURORE", "ANNAMARIA", "ALLEEN",
+	"AILENE", "AIDE", "YASMINE", "VASHTI", "VALENTINE", "TREASA", "TORY", "TIFFANEY", "SHERYLL", "SHARIE",
+	"SHANAE", "SAU", "RAISA", "PA", "NEDA", "MITSUKO", "MIRELLA", "MILDA", "MARYANNA", "MARAGRET",
+	"MABELLE", "LUETTA", "LORINA", "LETISHA", "LATARSHA", "LANELLE", "LAJUANA", "KRISSY", "KARLY", "KARENA",
+	"JON", "JESSIKA", "JERICA", "JEANELLE", "JANUARY", "JALISA", "JACELYN", "IZOLA", "IVEY", "GREGORY",
+	"EUNA", "ETHA", "DREW", "DOMITILA", "DOMINICA", "DAINA", "CREOLA", "CARLI", "CAMIE", "BUNNY",
+	"BRITTNY", "ASHANTI", "ANISHA", "ALEEN", "ADAH", "YASUKO", "WINTER", "VIKI", "VALRIE", "TONA",
+	"TINISHA", "THI", "TERISA", "TATUM", "TANEKA", "SIMONNE", "SHALANDA", "SERITA", "RESSIE", "REFUGIA",
+	"PAZ", "OLENE", "NA", "MERRILL", "MARGHERITA", "MANDIE", "MAN", "MAIRE", "LYNDIA", "LUCI",
+	"LORRIANE", "LORETA", "LEONIA", "LAVONA", "LASHAWNDA", "LAKIA", "KYOKO", "KRYSTINA", "KRYSTEN", "KENIA",
+	"KELSI", "JUDE", "JEANICE", "ISOBEL", "GEORGIANN", "GENNY", "FELICIDAD", "EILENE", "DEON", "DELOISE",
+	"DEEDEE", "DANNIE", "CONCEPTION", "CLORA", "CHERILYN", "CHANG", "CALANDRA", "BERRY", "ARMANDINA", "ANISA",
+	"ULA", "TIMOTHY", "TIERA", "THERESSA", "STEPHANIA", "SIMA", "SHYLA", "SHONTA", "SHERA", "SHAQUITA",
+	"SHALA", "SAMMY", "ROSSANA", "NOHEMI", "NERY", "MORIAH", "MELITA", "MELIDA", "MELANI", "MARYLYNN",
+	"MARISHA", "MARIETTE", "MALORIE", "MADELENE", "LUDIVINA", "LORIA", "LORETTE", "LORALEE", "LIANNE", "LEON",
+	"LAVENIA", "LAURINDA", "LASHON", "KIT", "KIMI", "KEILA", "KATELYNN", "KAI", "JONE", "JOANE",
+	"JI", "JAYNA", "JANELLA", "JA", "HUE", "HERTHA", "FRANCENE", "ELINORE", "DESPINA", "DELSIE",
+	"DEEDRA", "CLEMENCIA", "CARRY", "CAROLIN", "CARLOS", "BULAH", "BRITTANIE", "BOK", "BLONDELL", "BIBI",
+	"BEAULAH", "BEATA", "ANNITA", "AGRIPINA", "VIRGEN", "VALENE", "UN", "TWANDA", "TOMMYE", "TOI",
+	"TARRA", "TARI", "TAMMERA", "SHAKIA", "SADYE", "RUTHANNE", "ROCHEL", "RIVKA", "PURA", "NENITA",
+	"NATISHA", "MING", "MERRILEE", "MELODEE", "MARVIS", "LUCILLA", "LEENA", "LAVETA", "LARITA", "LANIE",
+	"KEREN", "ILEEN", "GEORGEANN", "GENNA", "GENESIS", "FRIDA", "EWA", "EUFEMIA", "EMELY", "ELA",
+	"EDYTH", "DEONNA", "DEADRA", "DARLENA", "CHANELL", "CHAN", "CATHERN", "CASSONDRA", "CASSAUNDRA", "BERNARDA",
+	"BERNA", "ARLINDA", "ANAMARIA", "ALBERT", "WESLEY", "VERTIE", "VALERI", "TORRI", "TATYANA", "STASIA",
+	"SHERISE", "SHERILL", "SEASON", "SCOTTIE", "SANDA", "RUTHE", "ROSY", "ROBERTO", "ROBBI", "RANEE",
+	"QUYEN", "PEARLY", "PALMIRA", "ONITA", "NISHA", "NIESHA", "NIDA", "NEVADA", "NAM", "MERLYN",
+	"MAYOLA", "MARYLOUISE", "MARYLAND", "MARX", "MARTH", "MARGENE", "MADELAINE", "LONDA", "LEONTINE", "LEOMA",
+	"LEIA", "LAWRENCE", "LAURALEE", "LANORA", "LAKITA", "KIYOKO", "KETURAH", "KATELIN", "KAREEN", "JONIE",
+	"JOHNETTE", "JENEE", "JEANETT", "IZETTA", "HIEDI", "HEIKE", "HASSIE", "HAROLD", "GIUSEPPINA", "GEORGANN",
+	"FIDELA", "FERNANDE", "ELWANDA", "ELLAMAE", "ELIZ", "DUSTI", "DOTTY", "CYNDY", "CORALIE", "CELESTA",
+	"ARGENTINA", "ALVERTA", "XENIA", "WAVA", "VANETTA", "TORRIE", "TASHINA", "TANDY", "TAMBRA", "TAMA",
+	"STEPANIE", "SHILA", "SHAUNTA", "SHARAN", "SHANIQUA", "SHAE", "SETSUKO", "SERAFINA", "SANDEE", "ROSAMARIA",
+	"PRISCILA", "OLINDA", "NADENE", "MUOI", "MICHELINA", "MERCEDEZ", "MARYROSE", "MARIN", "MARCENE", "MAO",
+	"MAGALI", "MAFALDA", "LOGAN", "LINN", "LANNIE", "KAYCE", "KAROLINE", "KAMILAH", "KAMALA", "JUSTA",
+	"JOLINE", "JENNINE", "JACQUETTA", "IRAIDA", "GERALD", "GEORGEANNA", "FRANCHESCA", "FAIRY", "EMELINE", "ELANE",
+	"EHTEL", "EARLIE", "DULCIE", "DALENE", "CRIS", "CLASSIE", "CHERE", "CHARIS", "CAROYLN", "CARMINA",
+	"CARITA", "BRIAN", "BETHANIE", "AYAKO", "ARICA", "AN", "ALYSA", "ALESSANDRA", "AKILAH", "ADRIEN",
+	"ZETTA", "YOULANDA", "YELENA", "YAHAIRA", "XUAN", "WENDOLYN", "VICTOR", "TIJUANA", "TERRELL", "TERINA",
+	"TERESIA", "SUZI", "SUNDAY", "SHERELL", "SHAVONDA", "SHAUNTE", "SHARDA", "SHAKITA", "SENA", "RYANN",
+	"RUBI", "RIVA", "REGINIA", "REA", "RACHAL", "PARTHENIA", "PAMULA", "MONNIE", "MONET", "MICHAELE",
+	"MELIA", "MARINE", "MALKA", "MAISHA", "LISANDRA", "LEO", "LEKISHA", "LEAN", "LAURENCE", "LAKENDRA",
+	"KRYSTIN", "KORTNEY", "KIZZIE", "KITTIE", "KERA", "KENDAL", "KEMBERLY", "KANISHA", "JULENE", "JULE",
+	"JOSHUA", "JOHANNE", "JEFFREY", "JAMEE", "HAN", "HALLEY", "GIDGET", "GALINA", "FREDRICKA", "FLETA",
+	"FATIMAH", "EUSEBIA", "ELZA", "ELEONORE", "DORTHEY", "DORIA", "DONELLA", "DINORAH", "DELORSE", "CLARETHA",
+	"CHRISTINIA", "CHARLYN", "BONG", "BELKIS", "AZZIE", "ANDERA", "AIKO", "ADENA", "YER", "YAJAIRA",
+	"WAN", "VANIA", "ULRIKE", "TOSHIA", "TIFANY", "STEFANY", "SHIZUE", "SHENIKA", "SHAWANNA", "SHAROLYN",
+	"SHARILYN", "SHAQUANA", "SHANTAY", "SEE", "ROZANNE", "ROSELEE", "RICKIE", "REMONA", "REANNA", "RAELENE",
+	"QUINN", "PHUNG", "PETRONILA", "NATACHA", "NANCEY", "MYRL", "MIYOKO", "MIESHA", "MERIDETH", "MARVELLA",
+	"MARQUITTA", "MARHTA", "MARCHELLE", "LIZETH", "LIBBIE", "LAHOMA", "LADAWN", "KINA", "KATHELEEN", "KATHARYN",
+	"KARISA", "KALEIGH", "JUNIE", "JULIEANN", "JOHNSIE", "JANEAN", "JAIMEE", "JACKQUELINE", "HISAKO", "HERMA",
+	"HELAINE", "GWYNETH", "GLENN", "GITA", "EUSTOLIA", "EMELINA", "ELIN", "EDRIS", "DONNETTE", "DONNETTA",
+	"DIERDRE", "DENAE", "DARCEL", "CLAUDE", "CLARISA", "CINDERELLA", "CHIA", "CHARLESETTA", "CHARITA", "CELSA",
+	"CASSY", "CASSI", "CARLEE", "BRUNA", "BRITTANEY", "BRANDE", "BILLI", "BAO", "ANTONETTA", "ANGLA",
+	"ANGELYN", "ANALISA", "ALANE", "WENONA", "WENDIE", "VERONIQUE", "VANNESA", "TOBIE", "TEMPIE", "SUMIKO",
+	"SULEMA", "SPARKLE", "SOMER", "SHEBA", "SHAYNE", "SHARICE", "SHANEL", "SHALON", "SAGE", "ROY",
+	"ROSIO", "ROSELIA", "RENAY", "REMA", "REENA", "PORSCHE", "PING", "PEG", "OZIE", "ORETHA",
+	"ORALEE", "ODA", "NU", "NGAN", "NAKESHA", "MILLY", "MARYBELLE", "MARLIN", "MARIS", "MARGRETT",
+	"MARAGARET", "MANIE", "LURLENE", "LILLIA", "LIESELOTTE", "LAVELLE", "LASHAUNDA", "LAKEESHA", "KEITH", "KAYCEE",
+	"KALYN", "JOYA", "JOETTE", "JENAE", "JANIECE", "ILLA", "GRISEL", "GLAYDS", "GENEVIE", "GALA",
+	"FREDDA", "FRED", "ELMER", "ELEONOR", "DEBERA", "DEANDREA", "DAN", "CORRINNE", "CORDIA", "CONTESSA",
+	"COLENE", "CLEOTILDE", "CHARLOTT", "CHANTAY", "CECILLE", "BEATRIS", "AZALEE", "ARLEAN", "ARDATH", "ANJELICA",
+	"ANJA", "ALFREDIA", "ALEISHA", "ADAM", "ZADA", "YUONNE", "XIAO", "WILLODEAN", "WHITLEY", "VENNIE",
+	"VANNA", "TYISHA", "TOVA", "TORIE", "TONISHA", "TILDA", "TIEN", "TEMPLE", "SIRENA", "SHERRIL",
+	"SHANTI", "SHAN", "SENAIDA", "SAMELLA", "ROBBYN", "RENDA", "REITA", "PHEBE", "PAULITA", "NOBUKO",
+	"NGUYET", "NEOMI", "MOON", "MIKAELA", "MELANIA", "MAXIMINA", "MARG", "MAISIE", "LYNNA", "LILLI",
+	"LAYNE", "LASHAUN", "LAKENYA", "LAEL", "KIRSTIE", "KATHLINE", "KASHA", "KARLYN", "KARIMA", "JOVAN",
+	"JOSEFINE", "JENNELL", "JACQUI", "JACKELYN", "HYO", "HIEN", "GRAZYNA", "FLORRIE", "FLORIA", "ELEONORA",
+	"DWANA", "DORLA", "DONG", "DELMY", "DEJA", "DEDE", "DANN", "CRYSTA", "CLELIA", "CLARIS",
+	"CLARENCE", "CHIEKO", "CHERLYN", "CHERELLE", "CHARMAIN", "CHARA", "CAMMY", "BEE", "ARNETTE", "ARDELLE",
+	"ANNIKA", "AMIEE", "AMEE", "ALLENA", "YVONE", "YUKI", "YOSHIE", "YEVETTE", "YAEL", "WILLETTA",
+	"VONCILE", "VENETTA", "TULA", "TONETTE", "TIMIKA", "TEMIKA", "TELMA", "TEISHA", "TAREN", "TA",
+	"STACEE", "SHIN", "SHAWNTA", "SATURNINA", "RICARDA", "POK", "PASTY", "ONIE", "NUBIA", "MORA",
+	"MIKE", "MARIELLE", "MARIELLA", "MARIANELA", "MARDELL", "MANY", "LUANNA", "LOISE", "LISABETH", "LINDSY",
+	"LILLIANA", "LILLIAM", "LELAH", "LEIGHA", "LEANORA", "LANG", "KRISTEEN", "KHALILAH", "KEELEY", "KANDRA",
+	"JUNKO", "JOAQUINA", "JERLENE", "JANI", "JAMIKA", "JAME", "HSIU", "HERMILA", "GOLDEN", "GENEVIVE",
+	"EVIA", "EUGENA", "EMMALINE", "ELFREDA", "ELENE", "DONETTE", "DELCIE", "DEEANNA", "DARCEY", "CUC",
+	"CLARINDA", "CIRA", "CHAE", "CELINDA", "CATHERYN", "CATHERIN", "CASIMIRA", "CARMELIA", "CAMELLIA", "BREANA",
+	"BOBETTE", "BERNARDINA", "BEBE", "BASILIA", "ARLYNE", "AMAL", "ALAYNA", "ZONIA", "ZENIA", "YURIKO",
+	"YAEKO", "WYNELL", "WILLOW", "WILLENA", "VERNIA", "TU", "TRAVIS", "TORA", "TERRILYN", "TERICA",
+	"TENESHA", "TAWNA", "TAJUANA", "TAINA", "STEPHNIE", "SONA", "SOL", "SINA", "SHONDRA", "SHIZUKO",
+	"SHERLENE", "SHERICE", "SHARIKA", "ROSSIE", "ROSENA", "RORY", "RIMA", "RIA", "RHEBA", "RENNA",
+	"PETER", "NATALYA", "NANCEE", "MELODI", "MEDA", "MAXIMA", "MATHA", "MARKETTA", "MARICRUZ", "MARCELENE",
+	"MALVINA", "LUBA", "LOUETTA", "LEIDA", "LECIA", "LAURAN", "LASHAWNA", "LAINE", "KHADIJAH", "KATERINE",
+	"KASI", "KALLIE", "JULIETTA", "JESUSITA", "JESTINE", "JESSIA", "JEREMY", "JEFFIE", "JANYCE", "ISADORA",
+	"GEORGIANNE", "FIDELIA", "EVITA", "EURA", "EULAH", "ESTEFANA", "ELSY", "ELIZABET", "ELADIA", "DODIE",
+	"DION", "DIA", "DENISSE", "DELORAS", "DELILA", "DAYSI", "DAKOTA", "CURTIS", "CRYSTLE", "CONCHA",
+	"COLBY", "CLARETTA", "CHU", "CHRISTIA", "CHARLSIE", "CHARLENA", "CARYLON", "BETTYANN", "ASLEY", "ASHLEA",
+	"AMIRA", "AI", "AGUEDA", "AGNUS", "YUETTE", "VINITA", "VICTORINA", "TYNISHA", "TREENA", "TOCCARA",
+	"TISH", "THOMASENA", "TEGAN", "SOILA", "SHILOH", "SHENNA", "SHARMAINE", "SHANTAE", "SHANDI", "SEPTEMBER",
+	"SARAN", "SARAI", "SANA", "SAMUEL", "SALLEY", "ROSETTE", "ROLANDE", "REGINE", "OTELIA", "OSCAR",
+	"OLEVIA", "NICHOLLE", "NECOLE", "NAIDA", "MYRTA", "MYESHA", "MITSUE", "MINTA", "MERTIE", "MARGY",
+	"MAHALIA", "MADALENE", "LOVE", "LOURA", "LOREAN", "LEWIS", "LESHA", "LEONIDA", "LENITA", "LAVONE",
+	"LASHELL", "LASHANDRA", "LAMONICA", "KIMBRA", "KATHERINA", "KARRY", "KANESHA", "JULIO", "JONG", "JENEVA",
+	"JAQUELYN", "HWA", "GILMA", "GHISLAINE", "GERTRUDIS", "FRANSISCA", "FERMINA", "ETTIE", "ETSUKO", "ELLIS",
+	"ELLAN", "ELIDIA", "EDRA", "DORETHEA", "DOREATHA", "DENYSE", "DENNY", "DEETTA", "DAINE", "CYRSTAL",
+	"CORRIN", "CAYLA", "CARLITA", "CAMILA", "BURMA", "BULA", "BUENA", "BLAKE", "BARABARA", "AVRIL",
+	"AUSTIN", "ALAINE", "ZANA", "WILHEMINA", "WANETTA", "VIRGIL", "VI", "VERONIKA", "VERNON", "VERLINE",
+	"VASILIKI", "TONITA", "TISA", "TEOFILA", "TAYNA", "TAUNYA", "TANDRA", "TAKAKO", "SUNNI", "SUANNE",
+	"SIXTA", "SHARELL", "SEEMA", "RUSSELL", "ROSENDA", "ROBENA", "RAYMONDE", "PEI", "PAMILA", "OZELL",
+	"NEIDA", "NEELY", "MISTIE", "MICHA", "MERISSA", "MAURITA", "MARYLN", "MARYETTA", "MARSHALL", "MARCELL",
+	"MALENA", "MAKEDA", "MADDIE", "LOVETTA", "LOURIE", "LORRINE", "LORILEE", "LESTER", "LAURENA", "LASHAY",
+	"LARRAINE", "LAREE", "LACRESHA", "KRISTLE", "KRISHNA", "KEVA", "KEIRA", "KAROLE", "JOIE", "JINNY",
+	"JEANNETTA", "JAMA", "HEIDY", "GILBERTE", "GEMA", "FAVIOLA", "EVELYNN", "ENDA", "ELLI", "ELLENA",
+	"DIVINA", "DAGNY", "COLLENE", "CODI", "CINDIE", "CHASSIDY", "CHASIDY", "CATRICE", "CATHERINA", "CASSEY",
+	"CAROLL", "CARLENA", "CANDRA", "CALISTA", "BRYANNA", "BRITTENY", "BEULA", "BARI", "AUDRIE", "AUDRIA",
+	"ARDELIA", "ANNELLE", "ANGILA", "ALONA", "ALLYN", "DOUGLAS", "ROGER", "JONATHAN", "RALPH", "NICHOLAS",
+	"BENJAMIN", "BRUCE", "HARRY", "WAYNE", "STEVE", "HOWARD", "ERNEST", "PHILLIP", "TODD", "CRAIG",
+	"ALAN", "PHILIP", "EARL", "DANNY", "BRYAN", "STANLEY", "LEONARD", "NATHAN", "MANUEL", "RODNEY",
+	"MARVIN", "VINCENT", "JEFFERY", "JEFF", "CHAD", "JACOB", "ALFRED", "BRADLEY", "HERBERT", "FREDERICK",
+	"EDWIN", "DON", "RICKY", "RANDALL", "BARRY", "BERNARD", "LEROY", "MARCUS", "THEODORE", "CLIFFORD",
+	"MIGUEL", "JIM", "TOM", "CALVIN", "BILL", "LLOYD", "DEREK", "WARREN", "DARRELL", "JEROME",
+	"FLOYD", "ALVIN", "TIM", "GORDON", "GREG", "JORGE", "DUSTIN", "PEDRO", "DERRICK", "ZACHARY",
+	"HERMAN", "GLEN", "HECTOR", "RICARDO", "RICK", "BRENT", "RAMON", "GILBERT", "MARC", "REGINALD",
+	"RUBEN", "NATHANIEL", "RAFAEL", "EDGAR", "MILTON", "RAUL", "BEN", "CHESTER", "DUANE", "FRANKLIN",
+	"BRAD", "RON", "ROLAND", "ARNOLD", "HARVEY", "JARED", "ERIK", "DARRYL", "NEIL", "JAVIER",
+	"FERNANDO", "CLINTON", "TED", "MATHEW", "TYRONE", "DARREN", "LANCE", "KURT", "ALLAN", "NELSON",
+	"GUY", "CLAYTON", "HUGH", "MAX", "DWAYNE", "DWIGHT", "ARMANDO", "FELIX", "EVERETT", "IAN",
+	"WALLACE", "KEN", "BOB", "ALFREDO", "ALBERTO", "DAVE", "IVAN", "BYRON", "ISAAC", "MORRIS",
+	"CLIFTON", "WILLARD", "ROSS", "ANDY", "SALVADOR", "KIRK", "SERGIO", "SETH", "KENT", "TERRANCE",
+	"EDUARDO", "TERRENCE", "ENRIQUE", "WADE", "STUART", "FREDRICK", "ARTURO", "ALEJANDRO", "NICK", "LUTHER",
+	"WENDELL", "JEREMIAH", "JULIUS", "OTIS", "TREVOR", "OLIVER", "LUKE", "HOMER", "GERARD", "DOUG",
+	"KENNY", "HUBERT", "LYLE", "MATT", "ALFONSO", "ORLANDO", "REX", "CARLTON", "ERNESTO", "NEAL",
+	"PABLO", "LORENZO", "OMAR", "WILBUR", "GRANT", "HORACE", "RODERICK", "ABRAHAM", "WILLIS", "RICKEY",
+	"ANDRES", "CESAR", "JOHNATHAN", "MALCOLM", "RUDOLPH", "DAMON", "KELVIN", "PRESTON", "ALTON", "ARCHIE",
+	"MARCO", "WM", "PETE", "RANDOLPH", "GARRY", "GEOFFREY", "JONATHON", "FELIPE", "GERARDO", "ED",
+	"DOMINIC", "DELBERT", "COLIN", "GUILLERMO", "EARNEST", "LUCAS", "BENNY", "SPENCER", "RODOLFO", "MYRON",
+	"EDMUND", "GARRETT", "SALVATORE", "CEDRIC", "LOWELL", "GREGG", "SHERMAN", "WILSON", "SYLVESTER", "ROOSEVELT",
+	"ISRAEL", "JERMAINE", "FORREST", "WILBERT", "LELAND", "SIMON", "CLARK", "IRVING", "BRYANT", "OWEN",
+	"RUFUS", "WOODROW", "KRISTOPHER", "MACK", "LEVI", "MARCOS", "GUSTAVO", "JAKE", "LIONEL", "GILBERTO",
+	"CLINT", "NICOLAS", "ISMAEL", "ORVILLE", "ERVIN", "DEWEY", "AL", "WILFRED", "JOSH", "HUGO",
+	"IGNACIO", "CALEB", "TOMAS", "SHELDON", "ERICK", "STEWART", "DOYLE", "DARREL", "ROGELIO", "TERENCE",
+	"SANTIAGO", "ALONZO", "ELIAS", "BERT", "ELBERT", "RAMIRO", "CONRAD", "NOAH", "GRADY", "PHIL",
+	"CORNELIUS", "LAMAR", "ROLANDO", "CLAY", "PERCY", "DEXTER", "BRADFORD", "DARIN", "AMOS", "MOSES",
+	"IRVIN", "SAUL", "ROMAN", "RANDAL", "TIMMY", "DARRIN", "WINSTON", "BRENDAN", "ABEL", "DOMINICK",
+	"BOYD", "EMILIO", "ELIJAH", "DOMINGO", "EMMETT", "MARLON", "EMANUEL", "JERALD", "EDMOND", "EMIL",
+	"DEWAYNE", "WILL", "OTTO", "TEDDY", "REYNALDO", "BRET", "JESS", "TRENT", "HUMBERTO", "EMMANUEL",
+	"STEPHAN", "VICENTE", "LAMONT", "GARLAND", "MILES", "EFRAIN", "HEATH", "RODGER", "HARLEY", "ETHAN",
+	"ELDON", "ROCKY", "PIERRE", "JUNIOR", "FREDDY", "ELI", "BRYCE", "ANTOINE", "STERLING", "CHASE",
+	"GROVER", "ELTON", "CLEVELAND", "DYLAN", "CHUCK", "DAMIAN", "REUBEN", "STAN", "AUGUST", "LEONARDO",
+	"JASPER", "RUSSEL", "ERWIN", "BENITO", "HANS", "MONTE", "BLAINE", "ERNIE", "CURT", "QUENTIN",
+	"AGUSTIN", "MURRAY", "JAMAL", "ADOLFO", "HARRISON", "TYSON", "BURTON", "BRADY", "ELLIOTT", "WILFREDO",
+	"BART", "JARROD", "VANCE", "DENIS", "DAMIEN", "JOAQUIN", "HARLAN", "DESMOND", "ELLIOT", "DARWIN",
+	"GREGORIO", "BUDDY", "XAVIER", "KERMIT", "ROSCOE", "ESTEBAN", "ANTON", "SOLOMON", "SCOTTY", "NORBERT",
+	"ELVIN", "WILLIAMS", "NOLAN", "ROD", "QUINTON", "HAL", "BRAIN", "ROB", "ELWOOD", "KENDRICK",
+	"DARIUS", "MOISES", "FIDEL", "THADDEUS", "CLIFF", "MARCEL", "JACKSON", "RAPHAEL", "BRYON", "ARMAND",
+	"ALVARO", "JEFFRY", "DANE", "JOESPH", "THURMAN", "NED", "RUSTY", "MONTY", "FABIAN", "REGGIE",
+	"MASON", "GRAHAM", "ISAIAH", "VAUGHN", "GUS", "LOYD", "DIEGO", "ADOLPH", "NORRIS", "MILLARD",
+	"ROCCO", "GONZALO", "DERICK", "RODRIGO", "WILEY", "RIGOBERTO", "ALPHONSO", "TY", "NOE", "VERN",
+	"REED", "JEFFERSON", "ELVIS", "BERNARDO", "MAURICIO", "HIRAM", "DONOVAN", "BASIL", "RILEY", "NICKOLAS",
+	"MAYNARD", "SCOT", "VINCE", "QUINCY", "EDDY", "SEBASTIAN", "FEDERICO", "ULYSSES", "HERIBERTO", "DONNELL",
+	"COLE", "DAVIS", "GAVIN", "EMERY", "WARD", "ROMEO", "JAYSON", "DANTE", "CLEMENT", "COY",
+	"MAXWELL", "JARVIS", "BRUNO", "ISSAC", "DUDLEY", "BROCK", "SANFORD", "CARMELO", "BARNEY", "NESTOR",
+	"STEFAN", "DONNY", "ART", "LINWOOD", "BEAU", "WELDON", "GALEN", "ISIDRO", "TRUMAN", "DELMAR",
+	"JOHNATHON", "SILAS", "FREDERIC", "DICK", "IRWIN", "MERLIN", "CHARLEY", "MARCELINO", "HARRIS", "CARLO",
+	"TRENTON", "KURTIS", "HUNTER", "AURELIO", "WINFRED", "VITO", "COLLIN", "DENVER", "CARTER", "LEONEL",
+	"EMORY", "PASQUALE", "MOHAMMAD", "MARIANO", "DANIAL", "LANDON", "DIRK", "BRANDEN", "ADAN", "BUFORD",
+	"GERMAN", "WILMER", "EMERSON", "ZACHERY", "FLETCHER", "JACQUES", "ERROL", "DALTON", "MONROE", "JOSUE",
+	"EDWARDO", "BOOKER", "WILFORD", "SONNY", "SHELTON", "CARSON", "THERON", "RAYMUNDO", "DAREN", "HOUSTON",
+	"ROBBY", "LINCOLN", "GENARO", "BENNETT", "OCTAVIO", "CORNELL", "HUNG", "ARRON", "ANTONY", "HERSCHEL",
+	"GIOVANNI", "GARTH", "CYRUS", "CYRIL", "RONNY", "LON", "FREEMAN", "DUNCAN", "KENNITH", "CARMINE",
+	"ERICH", "CHADWICK", "WILBURN", "RUSS", "REID", "MYLES", "ANDERSON", "MORTON", "JONAS", "FOREST",
+	"MITCHEL", "MERVIN", "ZANE", "RICH", "JAMEL", "LAZARO", "ALPHONSE", "RANDELL", "MAJOR", "JARRETT",
+	"BROOKS", "ABDUL", "LUCIANO", "SEYMOUR", "EUGENIO", "MOHAMMED", "VALENTIN", "CHANCE", "ARNULFO", "LUCIEN",
+	"FERDINAND", "THAD", "EZRA", "ALDO", "RUBIN", "ROYAL", "MITCH", "EARLE", "ABE", "WYATT",
+	"MARQUIS", "LANNY", "KAREEM", "JAMAR", "BORIS", "ISIAH", "EMILE", "ELMO", "ARON", "LEOPOLDO",
+	"EVERETTE", "JOSEF", "ELOY", "RODRICK", "REINALDO", "LUCIO", "JERROD", "WESTON", "HERSHEL", "BARTON",
+	"PARKER", "LEMUEL", "BURT", "JULES", "GIL", "ELISEO", "AHMAD", "NIGEL", "EFREN", "ANTWAN",
+	"ALDEN", "MARGARITO", "COLEMAN", "DINO", "OSVALDO", "LES", "DEANDRE", "NORMAND", "KIETH", "TREY",
+	"NORBERTO", "NAPOLEON", "JEROLD", "FRITZ", "ROSENDO", "MILFORD", "CHRISTOPER", "ALFONZO", "LYMAN", "JOSIAH",
+	"BRANT", "WILTON", "RICO", "JAMAAL", "DEWITT", "BRENTON", "OLIN", "FOSTER", "FAUSTINO", "CLAUDIO",
+	"JUDSON", "GINO", "EDGARDO", "ALEC", "TANNER", "JARRED", "DONN", "TAD", "PRINCE", "PORFIRIO",
+	"ODIS", "LENARD", "CHAUNCEY", "TOD", "MEL", "MARCELO", "KORY", "AUGUSTUS", "KEVEN", "HILARIO",
+	"BUD", "SAL", "ORVAL", "MAURO", "ZACHARIAH", "OLEN", "ANIBAL", "MILO", "JED", "DILLON",
+	"AMADO", "NEWTON", "LENNY", "RICHIE", "HORACIO", "BRICE", "MOHAMED", "DELMER", "DARIO", "REYES",
+	"MAC", "JONAH", "JERROLD", "ROBT", "HANK", "RUPERT", "ROLLAND", "KENTON", "DAMION", "ANTONE",
+	"WALDO", "FREDRIC", "BRADLY", "KIP", "BURL", "WALKER", "TYREE", "JEFFEREY", "AHMED", "WILLY",
+	"STANFORD", "OREN", "NOBLE", "MOSHE", "MIKEL", "ENOCH", "BRENDON", "QUINTIN", "JAMISON", "FLORENCIO",
+	"DARRICK", "TOBIAS", "HASSAN", "GIUSEPPE", "DEMARCUS", "CLETUS", "TYRELL", "LYNDON", "KEENAN", "WERNER",
+	"GERALDO", "COLUMBUS", "CHET", "BERTRAM", "MARKUS", "HUEY", "HILTON", "DWAIN", "DONTE", "TYRON",
+	"OMER", "ISAIAS", "HIPOLITO", "FERMIN", "ADALBERTO", "BO", "BARRETT", "TEODORO", "MCKINLEY", "MAXIMO",
+	"GARFIELD", "RALEIGH", "LAWERENCE", "ABRAM", "RASHAD", "KING", "EMMITT", "DARON", "SAMUAL", "MIQUEL",
+	"EUSEBIO", "DOMENIC", "DARRON", "BUSTER", "WILBER", "RENATO", "JC", "HOYT", "HAYWOOD", "EZEKIEL",
+	"CHAS", "FLORENTINO", "ELROY", "CLEMENTE", "ARDEN", "NEVILLE", "EDISON", "DESHAWN", "NATHANIAL", "JORDON",
+	"DANILO", "CLAUD", "SHERWOOD", "RAYMON", "RAYFORD", "CRISTOBAL", "AMBROSE", "TITUS", "HYMAN", "FELTON",
+	"EZEQUIEL", "ERASMO", "STANTON", "LONNY", "LEN", "IKE", "MILAN", "LINO", "JAROD", "HERB",
+	"ANDREAS", "WALTON", "RHETT", "PALMER", "DOUGLASS", "CORDELL", "OSWALDO", "ELLSWORTH", "VIRGILIO", "TONEY",
+	"NATHANAEL", "DEL", "BENEDICT", "MOSE", "JOHNSON", "ISREAL", "GARRET", "FAUSTO", "ASA", "ARLEN",
+	"ZACK", "WARNER", "MODESTO", "FRANCESCO", "MANUAL", "GAYLORD", "GASTON", "FILIBERTO", "DEANGELO", "MICHALE",
+	"GRANVILLE", "WES", "MALIK", "ZACKARY", "TUAN", "ELDRIDGE", "CRISTOPHER", "CORTEZ", "ANTIONE", "MALCOM",
+	"LONG", "KOREY", "JOSPEH", "COLTON", "WAYLON", "VON", "HOSEA", "SHAD", "SANTO", "RUDOLF",
+	"ROLF", "REY", "RENALDO", "MARCELLUS", "LUCIUS", "KRISTOFER", "BOYCE", "BENTON", "HAYDEN", "HARLAND",
+	"ARNOLDO", "RUEBEN", "LEANDRO", "KRAIG", "JERRELL", "JEROMY", "HOBERT", "CEDRICK", "ARLIE", "WINFORD",
+	"WALLY", "LUIGI", "KENETH", "JACINTO", "GRAIG", "FRANKLYN", "EDMUNDO", "SID", "PORTER", "LEIF",
+	"JERAMY", "BUCK", "WILLIAN", "VINCENZO", "SHON", "LYNWOOD", "JERE", "HAI", "ELDEN", "DORSEY",
+	"DARELL", "BRODERICK", "ALONSO"
+	]
+	total_sum = 0
+	temp_sum = 0
+	name.sort()
+	for i in range(len(name)):
+		for j in name[i]:
+			temp_sum += ord(j) - ord('A') + 1
+		total_sum += (i + 1) * temp_sum
+		temp_sum = 0
+	print(total_sum)
+
+
+if __name__ == '__main__':
+	main()
diff --git a/Project Euler/Problem 24/sol1.py b/Project Euler/Problem 24/sol1.py
new file mode 100644
index 000000000000..b20493cb03af
--- /dev/null
+++ b/Project Euler/Problem 24/sol1.py	
@@ -0,0 +1,7 @@
+from itertools import permutations
+def main():
+	result=list(map("".join, permutations('0123456789')))
+	print(result[999999])
+
+if __name__ == '__main__':
+	main()
\ No newline at end of file
diff --git a/Project Euler/Problem 25/sol1.py b/Project Euler/Problem 25/sol1.py
new file mode 100644
index 000000000000..f8cea3093dcf
--- /dev/null
+++ b/Project Euler/Problem 25/sol1.py	
@@ -0,0 +1,31 @@
+from __future__ import print_function
+
+try:
+	xrange			#Python 2
+except NameError:
+	xrange = range	#Python 3
+
+def fibonacci(n):
+	if n == 1 or type(n) is not int:
+		return 0
+	elif n == 2:
+		return 1
+	else:
+		sequence = [0, 1]
+		for i in xrange(2, n+1):
+			sequence.append(sequence[i-1] + sequence[i-2])
+
+		return sequence[n]
+
+def fibonacci_digits_index(n):
+	digits = 0
+	index = 2
+
+	while digits < n:
+		index += 1
+		digits = len(str(fibonacci(index)))
+
+	return index
+
+if __name__ == '__main__':
+	print(fibonacci_digits_index(1000))
\ No newline at end of file
diff --git a/Project Euler/Problem 28/sol1.py b/Project Euler/Problem 28/sol1.py
new file mode 100644
index 000000000000..4942115ce537
--- /dev/null
+++ b/Project Euler/Problem 28/sol1.py	
@@ -0,0 +1,29 @@
+from __future__ import print_function
+from math import ceil
+
+try:
+	xrange			#Python 2
+except NameError:
+	xrange = range	#Python 3
+
+def diagonal_sum(n):
+	total = 1
+
+	for i in xrange(1, int(ceil(n/2.0))):
+		odd = 2*i+1
+		even = 2*i
+		total = total + 4*odd**2 - 6*even
+
+	return total
+
+if __name__ == '__main__':
+	import sys
+
+	if len(sys.argv) == 1:
+		print(diagonal_sum(1001))
+	else:
+		try:
+			n = int(sys.argv[1])
+			diagonal_sum(n)
+		except ValueError:
+			print('Invalid entry - please enter a number')
\ No newline at end of file
diff --git a/Project Euler/Problem 29/solution.py b/Project Euler/Problem 29/solution.py
index 9d6148da3d87..64d35c84d9ca 100644
--- a/Project Euler/Problem 29/solution.py	
+++ b/Project Euler/Problem 29/solution.py	
@@ -1,16 +1,18 @@
 def main():
-    """ 
+    """
     Consider all integer combinations of ab for 2 <= a <= 5 and 2 <= b <= 5:
 
     22=4, 23=8, 24=16, 25=32
     32=9, 33=27, 34=81, 35=243
     42=16, 43=64, 44=256, 45=1024
     52=25, 53=125, 54=625, 55=3125
-    If they are then placed in numerical order, with any repeats removed, we get the following sequence of 15 distinct terms:
+    If they are then placed in numerical order, with any repeats removed,
+    we get the following sequence of 15 distinct terms:
 
     4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125
 
-    How many distinct terms are in the sequence generated by ab for 2 <= a <= 100 and 2 <= b <= 100?
+    How many distinct terms are in the sequence generated by ab
+    for 2 <= a <= 100 and 2 <= b <= 100?
     """
 
     collectPowers = set()
@@ -19,15 +21,12 @@ def main():
 
     N = 101     # maximum limit
 
-    for a in range(2,N):
-
-        for b in range (2,N):
-
+    for a in range(2, N):
+        for b in range(2, N):
             currentPow = a**b   # calculates the current power
             collectPowers.add(currentPow)   # adds the result to the set
-            
 
-    print "Number of terms ", len(collectPowers)
+    print("Number of terms ", len(collectPowers))
 
 
 if __name__ == '__main__':
diff --git a/Project Euler/Problem 36/sol1.py b/Project Euler/Problem 36/sol1.py
new file mode 100644
index 000000000000..d78e7e59f210
--- /dev/null
+++ b/Project Euler/Problem 36/sol1.py	
@@ -0,0 +1,30 @@
+from __future__ import print_function
+'''
+Double-base palindromes
+Problem 36
+The decimal number, 585 = 10010010012 (binary), is palindromic in both bases.
+
+Find the sum of all numbers, less than one million, which are palindromic in base 10 and base 2.
+
+(Please note that the palindromic number, in either base, may not include leading zeros.)
+'''
+try:
+	xrange		#Python 2
+except NameError:
+	xrange = range	#Python 3
+
+def is_palindrome(n):
+	n = str(n)
+
+	if n == n[::-1]:
+		return True
+	else:
+		return False
+
+total = 0
+
+for i in xrange(1, 1000000):
+	if is_palindrome(i) and is_palindrome(bin(i).split('b')[1]):
+		total += i
+
+print(total)
\ No newline at end of file
diff --git a/Project Euler/Problem 40/sol1.py b/Project Euler/Problem 40/sol1.py
new file mode 100644
index 000000000000..ab4017512a1a
--- /dev/null
+++ b/Project Euler/Problem 40/sol1.py	
@@ -0,0 +1,26 @@
+#-.- coding: latin-1 -.-
+from __future__ import print_function
+'''
+Champernowne's constant
+Problem 40
+An irrational decimal fraction is created by concatenating the positive integers:
+
+0.123456789101112131415161718192021...
+
+It can be seen that the 12th digit of the fractional part is 1.
+
+If dn represents the nth digit of the fractional part, find the value of the following expression.
+
+d1 × d10 × d100 × d1000 × d10000 × d100000 × d1000000
+'''
+
+constant = []
+i = 1
+
+while len(constant) < 1e6:
+	constant.append(str(i))
+	i += 1
+
+constant = ''.join(constant)
+
+print(int(constant[0])*int(constant[9])*int(constant[99])*int(constant[999])*int(constant[9999])*int(constant[99999])*int(constant[999999]))
\ No newline at end of file
diff --git a/Project Euler/Problem 48/sol1.py b/Project Euler/Problem 48/sol1.py
new file mode 100644
index 000000000000..5c4bdb0f6384
--- /dev/null
+++ b/Project Euler/Problem 48/sol1.py	
@@ -0,0 +1,21 @@
+from __future__ import print_function
+'''
+Self Powers
+Problem 48
+
+The series, 11 + 22 + 33 + ... + 1010 = 10405071317.
+
+Find the last ten digits of the series, 11 + 22 + 33 + ... + 10001000.
+'''
+
+try:
+	xrange
+except NameError:
+	xrange = range
+
+total = 0
+for i in xrange(1, 1001):
+	total += i**i
+
+
+print(str(total)[-10:])
\ No newline at end of file
diff --git a/Project Euler/Problem 52/sol1.py b/Project Euler/Problem 52/sol1.py
new file mode 100644
index 000000000000..376b4cfa1d63
--- /dev/null
+++ b/Project Euler/Problem 52/sol1.py	
@@ -0,0 +1,23 @@
+from __future__ import print_function
+'''
+Permuted multiples
+Problem 52
+
+It can be seen that the number, 125874, and its double, 251748, contain exactly the same digits, but in a different order.
+
+Find the smallest positive integer, x, such that 2x, 3x, 4x, 5x, and 6x, contain the same digits.
+'''
+i = 1
+
+while True:
+	if sorted(list(str(i))) == \
+       sorted(list(str(2*i))) == \
+       sorted(list(str(3*i))) == \
+       sorted(list(str(4*i))) == \
+       sorted(list(str(5*i))) == \
+       sorted(list(str(6*i))):
+		break
+
+	i += 1
+
+print(i) 
\ No newline at end of file
diff --git a/Project Euler/Problem 53/sol1.py b/Project Euler/Problem 53/sol1.py
new file mode 100644
index 000000000000..ed6d5329eb4e
--- /dev/null
+++ b/Project Euler/Problem 53/sol1.py	
@@ -0,0 +1,36 @@
+#-.- coding: latin-1 -.-
+from __future__ import print_function
+from math import factorial
+'''
+Combinatoric selections
+Problem 53
+
+There are exactly ten ways of selecting three from five, 12345:
+
+123, 124, 125, 134, 135, 145, 234, 235, 245, and 345
+
+In combinatorics, we use the notation, 5C3 = 10.
+
+In general,
+
+nCr = n!/(r!(n−r)!),where r ≤ n, n! = n×(n−1)×...×3×2×1, and 0! = 1.
+It is not until n = 23, that a value exceeds one-million: 23C10 = 1144066.
+
+How many, not necessarily distinct, values of nCr, for 1 ≤ n ≤ 100, are greater than one-million?
+'''
+try:
+	xrange		#Python 2
+except NameError:
+	xrange = range	#Python 3
+
+def combinations(n, r):
+	return factorial(n)/(factorial(r)*factorial(n-r))
+
+total = 0
+
+for i in xrange(1, 101):
+	for j in xrange(1, i+1):
+		if combinations(i, j) > 1e6:
+			total += 1
+
+print(total)
\ No newline at end of file
diff --git a/Project Euler/Problem 76/sol1.py b/Project Euler/Problem 76/sol1.py
new file mode 100644
index 000000000000..2832f6d7afb6
--- /dev/null
+++ b/Project Euler/Problem 76/sol1.py	
@@ -0,0 +1,35 @@
+from __future__ import print_function
+'''
+Counting Summations
+Problem 76
+
+It is possible to write five as a sum in exactly six different ways:
+
+4 + 1
+3 + 2
+3 + 1 + 1
+2 + 2 + 1
+2 + 1 + 1 + 1
+1 + 1 + 1 + 1 + 1
+
+How many different ways can one hundred be written as a sum of at least two positive integers?
+'''
+try:
+	xrange		#Python 2
+except NameError:
+	xrange = range	#Python 3
+
+def partition(m):
+	memo = [[0 for _ in xrange(m)] for _ in xrange(m+1)]
+	for i in xrange(m+1):
+		memo[i][0] = 1
+
+	for n in xrange(m+1):
+		for k in xrange(1, m):
+			memo[n][k] += memo[n][k-1]
+			if n > k:
+				memo[n][k] += memo[n-k-1][k]
+
+	return (memo[m][m-1] - 1)
+
+print(partition(100))
\ No newline at end of file
diff --git a/Project Euler/Problem 9/sol2.py b/Project Euler/Problem 9/sol2.py
new file mode 100644
index 000000000000..13674d25875e
--- /dev/null
+++ b/Project Euler/Problem 9/sol2.py	
@@ -0,0 +1,19 @@
+"""A Pythagorean triplet is a set of three natural numbers, for which,
+a^2+b^2=c^2
+Given N, Check if there exists any Pythagorean triplet for which a+b+c=N
+Find maximum possible value of product of a,b,c among all such Pythagorean triplets, If there is no such Pythagorean triplet print -1."""
+#!/bin/python3
+import sys
+
+product=-1
+d=0
+N = int(input())
+for a in range(1,N//3):
+    """Solving the two equations a**2+b**2=c**2 and a+b+c=N eliminating c """
+    b=(N*N-2*a*N)//(2*N-2*a)
+    c=N-a-b
+    if c*c==(a*a+b*b):
+        d=(a*b*c)
+        if d>=product:
+            product=d
+print(product)
diff --git a/README.md b/README.md
index 70077e98fd5a..bc31d5389dfd 100644
--- a/README.md
+++ b/README.md
@@ -41,8 +41,8 @@ From [Wikipedia][merge-wiki]: In computer science, merge sort (also commonly spe
 
 __Properties__
 * Worst case performance	O(n log n)
-* Best case performance	O(n)
-* Average case performance	O(n)
+* Best case performance	O(n log n)
+* Average case performance	O(n log n)
 
 
 ###### View the algorithm in [action][merge-toptal]
@@ -55,7 +55,7 @@ From [Wikipedia][quick-wiki]: Quicksort (sometimes called partition-exchange sor
 __Properties__
 * Worst case performance	O(n^2)
 * Best case performance	O(n log n) or O(n) with three-way partition
-* Average case performance	O(n^2)
+* Average case performance	O(n log n)
 
 ###### View the algorithm in [action][quick-toptal]
 
@@ -83,7 +83,7 @@ __Properties__
 
 ###### View the algorithm in [action][shell-toptal]
 
-### Time-Compexity Graphs
+### Time-Complexity Graphs
 
 Comparing the complexity of sorting algorithms (Bubble Sort, Insertion Sort, Selection Sort)
 
diff --git a/boolean_algebra/Quine_McCluskey/QuineMcCluskey.py b/boolean_algebra/Quine_McCluskey/QuineMcCluskey.py
new file mode 100644
index 000000000000..eb3a11f7ee31
--- /dev/null
+++ b/boolean_algebra/Quine_McCluskey/QuineMcCluskey.py
@@ -0,0 +1,116 @@
+def compare_string(string1, string2):
+	l1 = list(string1); l2 = list(string2)
+	count = 0
+	for i in range(len(l1)):
+		if l1[i] != l2[i]:
+			count += 1
+			l1[i] = '_'
+	if count > 1:
+		return -1
+	else:
+		return("".join(l1))
+
+def check(binary):
+	pi = []
+	while 1:
+		check1 = ['$']*len(binary)
+		temp = []
+		for i in range(len(binary)):
+			for j in range(i+1, len(binary)):
+				k=compare_string(binary[i], binary[j])
+				if k != -1:
+					check1[i] = '*'
+					check1[j] = '*'
+					temp.append(k)
+		for  i in range(len(binary)):
+			if check1[i] == '$':
+				pi.append(binary[i])
+		if len(temp) == 0:
+			return pi
+		binary = list(set(temp))
+
+def decimal_to_binary(no_of_variable, minterms):
+	temp = []
+	s = ''
+	for m in minterms:
+		for i in range(no_of_variable):
+			s = str(m%2) + s
+			m //= 2
+		temp.append(s)
+		s = ''
+	return temp
+
+def is_for_table(string1, string2, count):
+	l1 = list(string1);l2=list(string2)
+	count_n = 0
+	for i in range(len(l1)):
+		if l1[i] != l2[i]:
+			count_n += 1
+	if count_n == count:
+		return True
+	else:
+		return False 
+
+def selection(chart, prime_implicants):
+	temp = []
+	select = [0]*len(chart)
+	for i in range(len(chart[0])):
+		count = 0
+		rem = -1
+		for j in range(len(chart)):
+			if chart[j][i] == 1:
+				count += 1
+				rem = j
+		if count == 1:
+			select[rem] = 1
+	for i in range(len(select)):
+		if select[i] == 1:
+			for j in range(len(chart[0])):
+				if chart[i][j] == 1:
+					for k in range(len(chart)):
+						chart[k][j] = 0 
+			temp.append(prime_implicants[i])
+	while 1:
+		max_n = 0; rem = -1; count_n = 0
+		for i in range(len(chart)):
+			count_n = chart[i].count(1)
+			if count_n > max_n:
+				max_n = count_n
+				rem = i
+		
+		if max_n == 0:
+			return temp
+		
+		temp.append(prime_implicants[rem])
+		
+		for i in range(len(chart[0])):
+			if chart[rem][i] == 1:
+				for j in range(len(chart)):
+					chart[j][i] = 0
+		
+def prime_implicant_chart(prime_implicants, binary):
+	chart = [[0 for x in range(len(binary))] for x in range(len(prime_implicants))]
+	for i in range(len(prime_implicants)):
+		count = prime_implicants[i].count('_')
+		for j in range(len(binary)):
+			if(is_for_table(prime_implicants[i], binary[j], count)):
+				chart[i][j] = 1
+	
+	return chart
+
+def main():
+	no_of_variable = int(input("Enter the no. of variables\n"))
+	minterms = [int(x) for x in input("Enter the decimal representation of Minterms 'Spaces Seprated'\n").split()]
+	binary = decimal_to_binary(no_of_variable, minterms)
+	
+	prime_implicants = check(binary)
+	print("Prime Implicants are:")
+	print(prime_implicants)
+	chart = prime_implicant_chart(prime_implicants, binary)
+	
+	essential_prime_implicants = selection(chart,prime_implicants)
+	print("Essential Prime Implicants are:")
+	print(essential_prime_implicants)
+
+if __name__ == '__main__':
+	main()
\ No newline at end of file
diff --git a/ciphers/Onepad_Cipher.py b/ciphers/Onepad_Cipher.py
new file mode 100644
index 000000000000..7e1be5fdc077
--- /dev/null
+++ b/ciphers/Onepad_Cipher.py
@@ -0,0 +1,32 @@
+from __future__ import print_function
+
+import random
+
+
+class Onepad:
+    def encrypt(self, text):
+        '''Function to encrypt text using psedo-random numbers'''
+        plain = [ord(i) for i in text]
+        key = []
+        cipher = []
+        for i in plain:
+            k = random.randint(1, 300)
+            c = (i+k)*k
+            cipher.append(c)
+            key.append(k)
+        return cipher, key
+    
+    def decrypt(self, cipher, key):
+        '''Function to decrypt text using psedo-random numbers.'''
+        plain = []
+        for i in range(len(key)):
+            p = (cipher[i]-(key[i])**2)/key[i]
+            plain.append(chr(p))
+        plain = ''.join([i for i in plain])
+        return plain
+
+
+if __name__ == '__main__':
+    c, k = Onepad().encrypt('Hello')
+    print(c, k)
+    print(Onepad().decrypt(c, k))
diff --git a/ciphers/caesar_cipher.py b/ciphers/caesar_cipher.py
index a53dc5857fca..6cd35e73db0d 100644
--- a/ciphers/caesar_cipher.py
+++ b/ciphers/caesar_cipher.py
@@ -1,45 +1,68 @@
-from __future__ import print_function
-# The Caesar Cipher Algorithm
+import sys
+def encrypt(strng, key):
+    encrypted = ''
+    for x in strng:
+        indx = (ord(x) + key) % 256
+        if indx > 126:
+            indx = indx - 95
+        encrypted = encrypted + chr(indx)
+    return encrypted
 
-def main():
-    message = input("Enter message: ")
-    key     = int(input("Key [1-26]: "))
-    mode    = input("Encrypt or Decrypt [e/d]: ")
 
-    if mode.lower().startswith('e'):
-        mode = "encrypt"
-    elif mode.lower().startswith('d'):
-        mode = "decrypt"
+def decrypt(strng, key):
+    decrypted = ''
+    for x in strng:
+        indx = (ord(x) - key) % 256
+        if indx < 32:
+            indx = indx + 95
+        decrypted = decrypted + chr(indx)
+    return decrypted
 
-    translated = encdec(message, key, mode)
-    if mode ==   "encrypt":
-        print(("Encryption:", translated))
-    elif mode == "decrypt":
-        print(("Decryption:", translated))
-        
-def encdec(message, key, mode):
-    message    = message.upper()
-    translated = ""
-    LETTERS    = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
-    for symbol in message:
-        if symbol in LETTERS:
-            num = LETTERS.find(symbol)
-            if mode ==   "encrypt":
-                num = num + key
-            elif mode == "decrypt":
-                num = num - key
+def brute_force(strng):
+    key = 1
+    decrypted = ''
+    while key <= 94:
+        for x in strng:
+            indx = (ord(x) - key) % 256
+            if indx < 32:
+                indx = indx + 95
+            decrypted = decrypted + chr(indx)
+        print("Key: {}\t| Message: {}".format(key, decrypted))
+        decrypted = ''
+        key += 1
+    return None
 
-            if num >= len(LETTERS):
-                num -= len(LETTERS)
-            elif num < 0:
-                num += len(LETTERS)
 
-            translated += LETTERS[num]
-        else:
-            translated += symbol
-    return translated
+def main():
+    print('-' * 10 + "\n**Menu**\n" + '-' * 10)
+    print("1.Encrpyt")
+    print("2.Decrypt")
+    print("3.BruteForce")
+    print("4.Quit")
+    while True:
+        choice = input("What would you like to do?: ")
+        if choice not in ['1', '2', '3', '4']:
+            print ("Invalid choice")
+        elif choice == '1':
+            strng = input("Please enter the string to be ecrypted: ")
+            while True:
+                key = int(input("Please enter off-set between 1-94: "))
+                if key in range(1, 95):
+                    print (encrypt(strng, key))
+                    main()
+        elif choice == '2':
+            strng = input("Please enter the string to be decrypted: ")
+            while True:
+                key = int(input("Please enter off-set between 1-94: "))
+                if key > 0 and key <= 94:
+                    print(decrypt(strng, key))
+                    main()
+        elif choice == '3':
+            strng = input("Please enter the string to be decrypted: ")
+            brute_force(strng)
+            main()
+        elif choice == '4':
+            print ("Goodbye.")
+            sys.exit()
 
-if __name__ == '__main__':
-    import doctest
-    doctest.testmod()
-    main()
+main()
diff --git a/ciphers/elgamal_key_generator.py b/ciphers/elgamal_key_generator.py
new file mode 100644
index 000000000000..6a8751f69524
--- /dev/null
+++ b/ciphers/elgamal_key_generator.py
@@ -0,0 +1,63 @@
+import os
+import random
+import sys
+import rabin_miller as rabinMiller, cryptomath_module as cryptoMath
+
+min_primitive_root = 3
+
+
+def main():
+    print('Making key files...')
+    makeKeyFiles('elgamal', 2048)
+    print('Key files generation successful')
+
+
+# I have written my code naively same as definition of primitive root
+# however every time I run this program, memory exceeded...
+# so I used 4.80 Algorithm in Handbook of Applied Cryptography(CRC Press, ISBN : 0-8493-8523-7, October 1996)
+# and it seems to run nicely!
+def primitiveRoot(p_val):
+    print("Generating primitive root of p")
+    while True:
+        g = random.randrange(3,p_val)
+        if pow(g, 2, p_val) == 1:
+            continue
+        if pow(g, p_val, p_val) == 1:
+            continue
+        return g
+
+
+def generateKey(keySize):
+    print('Generating prime p...')
+    p = rabinMiller.generateLargePrime(keySize)  # select large prime number.
+    e_1 = primitiveRoot(p)  # one primitive root on modulo p.
+    d = random.randrange(3, p)  # private_key -> have to be greater than 2 for safety.
+    e_2 = cryptoMath.findModInverse(pow(e_1, d, p), p)
+
+    publicKey = (keySize, e_1, e_2, p)
+    privateKey = (keySize, d)
+
+    return publicKey, privateKey
+
+
+def makeKeyFiles(name, keySize):
+    if os.path.exists('%s_pubkey.txt' % name) or os.path.exists('%s_privkey.txt' % name):
+        print('\nWARNING:')
+        print('"%s_pubkey.txt" or "%s_privkey.txt" already exists. \n'
+              'Use a different name or delete these files and re-run this program.' %
+              (name, name))
+        sys.exit()
+
+    publicKey, privateKey = generateKey(keySize)
+    print('\nWriting public key to file %s_pubkey.txt...' % name)
+    with open('%s_pubkey.txt' % name, 'w') as fo:
+        fo.write('%d,%d,%d,%d' % (publicKey[0], publicKey[1], publicKey[2], publicKey[3]))
+
+    print('Writing private key to file %s_privkey.txt...' % name)
+    with open('%s_privkey.txt' % name, 'w') as fo:
+        fo.write('%d,%d' % (privateKey[0], privateKey[1]))
+
+
+if __name__ == '__main__':
+    main()
+    
\ No newline at end of file
diff --git a/data_structures/Arrays b/data_structures/Arrays
deleted file mode 100644
index e2c1243f5f96..000000000000
--- a/data_structures/Arrays
+++ /dev/null
@@ -1 +0,0 @@
-Arrays implementation using python programming.
diff --git a/data_structures/Arrays.py b/data_structures/Arrays.py
new file mode 100644
index 000000000000..3ec9f8976673
--- /dev/null
+++ b/data_structures/Arrays.py
@@ -0,0 +1,3 @@
+arr = [10, 20, 30, 40]
+arr[1] = 30
+print(arr)
diff --git a/data_structures/Binary Tree/SegmentTree.py b/data_structures/Binary Tree/SegmentTree.py
index a3b128c9d8b9..001bf999f391 100644
--- a/data_structures/Binary Tree/SegmentTree.py	
+++ b/data_structures/Binary Tree/SegmentTree.py	
@@ -3,63 +3,69 @@
 
 class SegmentTree:
     
-    def __init__(self, N):
-        self.N = N
-        self.st = [0 for i in range(0,4*N)] # approximate the overall size of segment tree with array N
+    def __init__(self, A):
+        self.N = len(A)
+        self.st = [0] * (4 * self.N) # approximate the overall size of segment tree with array N
+        self.build(1, 0, self.N - 1)
         
     def left(self, idx):
-        return idx*2
+        return idx * 2
 
     def right(self, idx):
-        return idx*2 + 1
+        return idx * 2 + 1
 
-    def build(self, idx, l, r, A):
-        if l==r:
-            self.st[idx] = A[l-1]
-        else :
-            mid = (l+r)//2
-            self.build(self.left(idx),l,mid, A)
-            self.build(self.right(idx),mid+1,r, A)
+    def build(self, idx, l, r):
+        if l == r:
+            self.st[idx] = A[l]
+        else:
+            mid = (l + r) // 2
+            self.build(self.left(idx), l, mid)
+            self.build(self.right(idx), mid + 1, r)
             self.st[idx] = max(self.st[self.left(idx)] , self.st[self.right(idx)])
     
-    def update(self, idx, l, r, a, b, val): # update(1, 1, N, a, b, v) for update val v to [a,b]
+    def update(self, a, b, val):
+        return self.update_recursive(1, 0, self.N - 1, a - 1, b - 1, val)
+    
+    def update_recursive(self, idx, l, r, a, b, val): # update(1, 1, N, a, b, v) for update val v to [a,b]
         if r < a or l > b:
             return True
         if l == r :
             self.st[idx] = val
             return True
         mid = (l+r)//2
-        self.update(self.left(idx),l,mid,a,b,val)
-        self.update(self.right(idx),mid+1,r,a,b,val)
+        self.update_recursive(self.left(idx), l, mid, a, b, val)
+        self.update_recursive(self.right(idx), mid+1, r, a, b, val)
         self.st[idx] = max(self.st[self.left(idx)] , self.st[self.right(idx)])
         return True
 
-    def query(self, idx, l, r, a, b): #query(1, 1, N, a, b) for query max of [a,b]
+    def query(self, a, b):
+        return self.query_recursive(1, 0, self.N - 1, a - 1, b - 1)
+
+    def query_recursive(self, idx, l, r, a, b): #query(1, 1, N, a, b) for query max of [a,b]
         if r < a or l > b:
             return -math.inf
         if l >= a and r <= b:
             return self.st[idx]
         mid = (l+r)//2
-        q1 = self.query(self.left(idx),l,mid,a,b)
-        q2 = self.query(self.right(idx),mid+1,r,a,b)
-        return max(q1,q2)
+        q1 = self.query_recursive(self.left(idx), l, mid, a, b)
+        q2 = self.query_recursive(self.right(idx), mid + 1, r, a, b)
+        return max(q1, q2)
 
     def showData(self):
         showList = []
         for i in range(1,N+1):
-            showList += [self.query(1, 1, self.N, i, i)]
+            showList += [self.query(i, i)]
         print (showList)
             
 
 if __name__ == '__main__':
     A = [1,2,-4,7,3,-5,6,11,-20,9,14,15,5,2,-8]
     N = 15
-    segt = SegmentTree(N)
-    segt.build(1,1,N,A)
-    print (segt.query(1,1,N,4,6))
-    print (segt.query(1,1,N,7,11))
-    print (segt.query(1,1,N,7,12))
-    segt.update(1,1,N,1,3,111)
-    print (segt.query(1,1,N,1,15))
-    segt.update(1,1,N,7,8,235)
+    segt = SegmentTree(A)
+    print (segt.query(4, 6))
+    print (segt.query(7, 11))
+    print (segt.query(7, 12))
+    segt.update(1,3,111)
+    print (segt.query(1, 15))
+    segt.update(7,8,235)
     segt.showData()
diff --git a/data_structures/LinkedList/singly_LinkedList.py b/data_structures/LinkedList/singly_LinkedList.py
index 7358b3c07f35..eb7f48f17359 100644
--- a/data_structures/LinkedList/singly_LinkedList.py
+++ b/data_structures/LinkedList/singly_LinkedList.py
@@ -1,61 +1,63 @@
 from __future__ import print_function
-class Node:#create a Node
-    def __int__(self,data):
-        self.data=data#given data
-        self.next=None#given next to None
+
+
+class Node:  # create a Node
+    def __init__(self, data):
+        self.data = data  # given data
+        self.next = None  # given next to None
+
+
 class Linked_List:
-    
-    pass
-    
-    def insert_tail(Head,data):
-        if(Head.next is None):
+    def insert_tail(Head, data):
+        if Head.next is None:
             Head.next = Node(data)
         else:
-            insert_tail(Head.next, data)
+            Head.next.insert_tail(data)
 
-    def insert_head(Head,data):
+    def insert_head(Head, data):
         tamp = Head
-        if (tamp == None):
-            newNod = Node()#create a new Node
+        if tamp is None:
+            newNod = Node()  # create a new Node
             newNod.data = data
             newNod.next = None
-            Head = newNod#make new node to Head       
+            Head = newNod  # make new node to Head
         else:
             newNod = Node()
             newNod.data = data
-            newNod.next = Head#put the Head at NewNode Next
-            Head=newNod#make a NewNode to Head
-        return Head   
-    
-    def printList(Head):#print every node data
-        tamp=Head
-        while tamp!=None:
+            newNod.next = Head  # put the Head at NewNode Next
+            Head = newNod  # make a NewNode to Head
+        return Head
+
+    def printList(Head):  # print every node data
+        tamp = Head
+        while tamp is not None:
             print(tamp.data)
-            tamp=tamp.next
-    
-    def delete_head(Head):#delete from head
-        if Head!=None:
-            Head=Head.next
-        return Head#return new Head
-    
-    def delete_tail(Head):#delete from tail
-        if Head!=None:
+            tamp = tamp.next
+
+    def delete_head(Head):  # delete from head
+        if Head is not None:
+            Head = Head.next
+        return Head  # return new Head
+
+    def delete_tail(Head):  # delete from tail
+        if Head is not None:
             tamp = Node()
             tamp = Head
-            while (tamp.next).next!= None:#find the 2nd last element
+            while tamp.next.next is not None:  # find the 2nd last element
                 tamp = tamp.next
-            tamp.next=None#delete the last element by give next None to 2nd last Element
+            # delete the last element by give next None to 2nd last Element
+            tamp.next = None
         return Head
 
     def isEmpty(Head):
-        return Head is None #Return if Head is none
-    
+        return Head is None  # Return if Head is none
+
     def reverse(Head):
         prev = None
         current = Head
-        
-        while(current):
-            # Store the current node's next node. 
+
+        while current:
+            # Store the current node's next node.
             next_node = current.next
             # Make the current node's next point backwards
             current.next = prev
@@ -63,5 +65,5 @@ def reverse(Head):
             prev = current
             # Make the current node the next node (to progress iteration)
             current = next_node
-        # Return prev in order to put the head at the end 
+        # Return prev in order to put the head at the end
         Head = prev
diff --git a/data_structures/Trie/Trie.py b/data_structures/Trie/Trie.py
index 7c886144d1f4..b6234c6704c6 100644
--- a/data_structures/Trie/Trie.py
+++ b/data_structures/Trie/Trie.py
@@ -12,7 +12,7 @@ def __init__(self):
         self.nodes = dict()  # Mapping from char to TrieNode
         self.is_leaf = False
 
-    def insert_many(self, words: [str]):
+    def insert_many(self, words: [str]):  # noqa: E999 This syntax is Python 3 only
         """
         Inserts a list of words into the Trie
         :param words: list of string words
@@ -21,7 +21,7 @@ def insert_many(self, words: [str]):
         for word in words:
             self.insert(word)
 
-    def insert(self, word: str):
+    def insert(self, word: str):  # noqa: E999 This syntax is Python 3 only
         """
         Inserts a word into the Trie
         :param word: word to be inserted
@@ -34,7 +34,7 @@ def insert(self, word: str):
             curr = curr.nodes[char]
         curr.is_leaf = True
 
-    def find(self, word: str) -> bool:
+    def find(self, word: str) -> bool:  # noqa: E999 This syntax is Python 3 only
         """
         Tries to find word in a Trie
         :param word: word to look for
@@ -48,7 +48,7 @@ def find(self, word: str) -> bool:
         return curr.is_leaf
 
 
-def print_words(node: TrieNode, word: str):
+def print_words(node: TrieNode, word: str):  # noqa: E999 This syntax is Python 3 only
     """
     Prints all the words in a Trie
     :param node: root node of Trie
diff --git a/data_structures/hashing/__init__.py b/data_structures/hashing/__init__.py
new file mode 100644
index 000000000000..b96ddd478458
--- /dev/null
+++ b/data_structures/hashing/__init__.py
@@ -0,0 +1,6 @@
+from .hash_table import HashTable
+
+class QuadraticProbing(HashTable):
+
+    def __init__(self):
+        super(self.__class__, self).__init__()
diff --git a/data_structures/hashing/double_hash.py b/data_structures/hashing/double_hash.py
new file mode 100644
index 000000000000..60098cda0ce1
--- /dev/null
+++ b/data_structures/hashing/double_hash.py
@@ -0,0 +1,33 @@
+#!/usr/bin/env python3
+
+from .hash_table import HashTable
+from number_theory.prime_numbers import next_prime, check_prime
+
+
+class DoubleHash(HashTable):
+    """
+        Hash Table example with open addressing and Double Hash
+    """
+    def __init__(self, *args, **kwargs):
+        super().__init__(*args, **kwargs)
+
+    def __hash_function_2(self, value, data):
+
+        next_prime_gt = next_prime(value % self.size_table) \
+            if not check_prime(value % self.size_table) else value % self.size_table  #gt = bigger than
+        return next_prime_gt - (data % next_prime_gt)
+
+    def __hash_double_function(self, key, data, increment):
+        return (increment * self.__hash_function_2(key, data)) % self.size_table
+
+    def _colision_resolution(self, key, data=None):
+        i = 1
+        new_key = self.hash_function(data)
+
+        while self.values[new_key] is not None and self.values[new_key] != key:
+            new_key = self.__hash_double_function(key, data, i) if \
+                self.balanced_factor() >= self.lim_charge else None
+            if new_key is None: break 
+            else: i += 1
+
+        return new_key
diff --git a/data_structures/hashing/hash_table.py b/data_structures/hashing/hash_table.py
new file mode 100644
index 000000000000..f0de128d1ad1
--- /dev/null
+++ b/data_structures/hashing/hash_table.py
@@ -0,0 +1,84 @@
+#!/usr/bin/env python3
+from number_theory.prime_numbers import next_prime
+
+
+class HashTable:
+    """
+        Basic Hash Table example with open addressing and linear probing
+    """
+
+    def __init__(self, size_table, charge_factor=None, lim_charge=None):
+        self.size_table = size_table
+        self.values = [None] * self.size_table
+        self.lim_charge = 0.75 if lim_charge is None else lim_charge
+        self.charge_factor = 1 if charge_factor is None else charge_factor
+        self.__aux_list = []
+        self._keys = {}
+
+    def keys(self):
+        return self._keys
+
+    def balanced_factor(self):
+        return sum([1 for slot in self.values
+                    if slot is not None]) / (self.size_table * self.charge_factor)
+
+    def hash_function(self, key):
+        return key % self.size_table
+
+    def _step_by_step(self, step_ord):
+
+        print("step {0}".format(step_ord))
+        print([i for i in range(len(self.values))])
+        print(self.values)
+
+    def bulk_insert(self, values):
+        i = 1
+        self.__aux_list = values
+        for value in values:
+            self.insert_data(value)
+            self._step_by_step(i)
+            i += 1
+
+    def _set_value(self, key, data):
+        self.values[key] = data
+        self._keys[key] = data
+
+    def _colision_resolution(self, key, data=None):
+        new_key = self.hash_function(key + 1)
+
+        while self.values[new_key] is not None \
+                and self.values[new_key] != key:
+
+            if self.values.count(None) > 0:
+                new_key = self.hash_function(new_key + 1)
+            else:
+                new_key = None
+                break
+
+        return new_key
+
+    def rehashing(self):
+        survivor_values = [value for value in self.values if value is not None]
+        self.size_table = next_prime(self.size_table, factor=2)
+        self._keys.clear()
+        self.values = [None] * self.size_table #hell's pointers D: don't DRY ;/
+        map(self.insert_data, survivor_values)
+
+    def insert_data(self, data):
+        key = self.hash_function(data)
+
+        if self.values[key] is None:
+            self._set_value(key, data)
+
+        elif self.values[key] == data:
+            pass
+
+        else:
+            colision_resolution = self._colision_resolution(key, data)
+            if colision_resolution is not None:
+                self._set_value(colision_resolution, data)
+            else:
+                self.rehashing()
+                self.insert_data(data)
+
+
diff --git a/data_structures/hashing/hash_table_with_linked_list.py b/data_structures/hashing/hash_table_with_linked_list.py
new file mode 100644
index 000000000000..9689e4fc9fcf
--- /dev/null
+++ b/data_structures/hashing/hash_table_with_linked_list.py
@@ -0,0 +1,24 @@
+from .hash_table import HashTable
+from collections import deque
+
+
+class HashTableWithLinkedList(HashTable):
+    def __init__(self, *args, **kwargs):
+        super().__init__(*args, **kwargs)
+
+    def _set_value(self, key, data):
+        self.values[key] = deque([]) if self.values[key] is None else self.values[key]  
+        self.values[key].appendleft(data)
+        self._keys[key] = self.values[key]
+
+    def balanced_factor(self):
+        return sum([self.charge_factor - len(slot) for slot in self.values])\
+               / self.size_table * self.charge_factor
+    
+    def _colision_resolution(self, key, data=None):
+        if not (len(self.values[key]) == self.charge_factor
+                and self.values.count(None) == 0):
+            return key
+        return super()._colision_resolution(key, data)
+
+
diff --git a/data_structures/hashing/number_theory/__init__.py b/data_structures/hashing/number_theory/__init__.py
new file mode 100644
index 000000000000..e69de29bb2d1
diff --git a/data_structures/hashing/number_theory/prime_numbers.py b/data_structures/hashing/number_theory/prime_numbers.py
new file mode 100644
index 000000000000..8a521bc45758
--- /dev/null
+++ b/data_structures/hashing/number_theory/prime_numbers.py
@@ -0,0 +1,29 @@
+#!/usr/bin/env python3
+"""
+    module to operations with prime numbers
+"""
+
+
+def check_prime(number):
+        """
+            it's not the best solution
+        """
+        special_non_primes = [0,1,2]
+        if number in special_non_primes[:2]:
+            return 2
+        elif number == special_non_primes[-1]:
+            return 3
+            
+        return all([number % i for i in range(2, number)])
+
+
+def next_prime(value, factor=1, **kwargs):
+    value = factor * value
+    first_value_val = value
+    
+    while not check_prime(value):
+        value += 1 if not ("desc" in kwargs.keys() and kwargs["desc"] is True) else -1
+    
+    if value == first_value_val:
+        return next_prime(value + 1, **kwargs)
+    return value
diff --git a/data_structures/hashing/quadratic_probing.py b/data_structures/hashing/quadratic_probing.py
new file mode 100644
index 000000000000..f7a9ac1ae347
--- /dev/null
+++ b/data_structures/hashing/quadratic_probing.py
@@ -0,0 +1,26 @@
+#!/usr/bin/env python3
+
+from .hash_table import HashTable
+
+
+class QuadraticProbing(HashTable):
+    """
+        Basic Hash Table example with open addressing using Quadratic Probing 
+    """
+    def __init__(self, *args, **kwargs):
+        super().__init__(*args, **kwargs)
+
+    def _colision_resolution(self, key, data=None):
+        i = 1
+        new_key = self.hash_function(key + i*i)
+
+        while self.values[new_key] is not None \
+                and self.values[new_key] != key:
+            i += 1
+            new_key = self.hash_function(key + i*i) if not \
+                self.balanced_factor() >= self.lim_charge else None
+
+            if new_key is None:
+                break
+
+        return new_key
diff --git a/dynamic_programming/abbreviation.py b/dynamic_programming/abbreviation.py
index 44a1689809b8..f4d07e402925 100644
--- a/dynamic_programming/abbreviation.py
+++ b/dynamic_programming/abbreviation.py
@@ -10,6 +10,8 @@
 a=daBcd and b="ABC"
 daBcd -> capitalize a and c(dABCd) -> remove d (ABC)
 """
+
+
 def abbr(a, b):
     n = len(a)
     m = len(b)
@@ -26,4 +28,4 @@ def abbr(a, b):
 
 
 if __name__ == "__main__":
-    print abbr("daBcd", "ABC") # expect True
+    print(abbr("daBcd", "ABC"))  # expect True
diff --git a/dynamic_programming/fastfibonacci.py b/dynamic_programming/fastfibonacci.py
index cdfa2dd08084..66d2b2ff0a54 100644
--- a/dynamic_programming/fastfibonacci.py
+++ b/dynamic_programming/fastfibonacci.py
@@ -7,14 +7,14 @@
 
 
 # returns F(n)
-def fibonacci(n: int):
+def fibonacci(n: int):  # noqa: E999 This syntax is Python 3 only
     if n < 0:
         raise ValueError("Negative arguments are not supported")
     return _fib(n)[0]
 
 
 # returns (F(n), F(n-1))
-def _fib(n: int):
+def _fib(n: int):  # noqa: E999 This syntax is Python 3 only
     if n == 0:
         # (F(0), F(1))
         return (0, 1)
diff --git a/dynamic_programming/integer_partition.py b/dynamic_programming/integer_partition.py
new file mode 100644
index 000000000000..7b27afebaa6c
--- /dev/null
+++ b/dynamic_programming/integer_partition.py
@@ -0,0 +1,45 @@
+from __future__ import print_function
+
+try:
+	xrange		#Python 2
+except NameError:
+	xrange = range	#Python 3
+
+try:
+	raw_input		#Python 2
+except NameError:
+	raw_input = input	#Python 3
+
+'''
+The number of partitions of a number n into at least k parts equals the number of partitions into exactly k parts
+plus the number of partitions into at least k-1 parts. Subtracting 1 from each part of a partition of n into k parts
+gives a partition of n-k into k parts. These two facts together are used for this algorithm.
+'''
+def partition(m):
+	memo = [[0 for _ in xrange(m)] for _ in xrange(m+1)]
+	for i in xrange(m+1):
+		memo[i][0] = 1
+
+	for n in xrange(m+1):
+		for k in xrange(1, m):
+			memo[n][k] += memo[n][k-1]
+			if n-k > 0:
+				memo[n][k] += memo[n-k-1][k]
+
+	return memo[m][m-1]
+
+if __name__ == '__main__':
+	import sys
+
+	if len(sys.argv) == 1:
+		try:
+			n = int(raw_input('Enter a number: '))
+			print(partition(n))
+		except ValueError:
+			print('Please enter a number.')
+	else:
+		try:
+			n = int(sys.argv[1])
+			print(partition(n))
+		except ValueError:
+			print('Please pass a number.')
\ No newline at end of file
diff --git a/dynamic_programming/knapsack.py b/dynamic_programming/knapsack.py
index a1e4f0d80daf..27d1cfed799b 100644
--- a/dynamic_programming/knapsack.py
+++ b/dynamic_programming/knapsack.py
@@ -1,6 +1,21 @@
 """
 Given weights and values of n items, put these items in a knapsack of capacity W to get the maximum total value in the knapsack.
 """
+def MF_knapsack(i,wt,val,j):
+    '''
+    This code involves the concept of memory functions. Here we solve the subproblems which are needed
+    unlike the below example
+    F is a 2D array with -1s filled up
+    '''
+    global F  # a global dp table for knapsack
+    if F[i][j] < 0:
+        if j < wt[i - 1]:
+            val = MF_knapsack(i - 1,wt,val,j)
+        else:
+            val = max(MF_knapsack(i - 1,wt,val,j),MF_knapsack(i - 1,wt,val,j - wt[i - 1]) + val[i - 1])
+        F[i][j] = val
+    return F[i][j]
+
 def knapsack(W, wt, val, n):
     dp = [[0 for i in range(W+1)]for j in range(n+1)]
 
@@ -12,3 +27,16 @@ def knapsack(W, wt, val, n):
                 dp[i][w] = dp[i-1][w]
 
     return dp[n][w]
+
+if __name__ == '__main__':
+    '''
+    Adding test case for knapsack
+    '''
+    val = [3,2,4,4]
+    wt = [4,3,2,3]
+    n = 4
+    w = 6
+    F = [[0]*(w + 1)] + [[0] + [-1 for i in range(w + 1)] for j in range(n + 1)]
+    print(knapsack(w,wt,val,n))
+    print(MF_knapsack(n,wt,val,w))  # switched the n and w 
+    
diff --git a/dynamic_programming/matrix_chain_order.py b/dynamic_programming/matrix_chain_order.py
new file mode 100644
index 000000000000..011e85755d36
--- /dev/null
+++ b/dynamic_programming/matrix_chain_order.py
@@ -0,0 +1,48 @@
+from __future__ import print_function
+
+import sys
+'''
+Dynamic Programming
+Implementation of Matrix Chain Multiplication
+Time Complexity: O(n^3)
+Space Complexity: O(n^2)
+'''
+def MatrixChainOrder(array):
+    N=len(array)
+    Matrix=[[0 for x in range(N)] for x in range(N)]
+    Sol=[[0 for x in range(N)] for x in range(N)]
+    for i in range(1,N):
+        Matrix[i][i]=0
+
+    for ChainLength in range(2,N):
+        for a in range(1,N-ChainLength+1):
+            b = a+ChainLength-1
+
+            Matrix[a][b] = sys.maxsize
+            for c in range(a , b):
+                cost = Matrix[a][c] + Matrix[c+1][b] + array[a-1]*array[c]*array[b]
+                if cost < Matrix[a][b]:
+                    Matrix[a][b] = cost
+                    Sol[a][b] = c
+    return Matrix , Sol
+#Print order of matrix with Ai as Matrix
+def PrintOptimalSolution(OptimalSolution,i,j):
+    if i==j:
+        print("A" + str(i),end = " ")
+    else:
+        print("(",end = " ")
+        PrintOptimalSolution(OptimalSolution,i,OptimalSolution[i][j])
+        PrintOptimalSolution(OptimalSolution,OptimalSolution[i][j]+1,j)
+        print(")",end = " ")
+
+def main():
+    array=[30,35,15,5,10,20,25]
+    n=len(array)
+    #Size of matrix created from above array will be
+    # 30*35 35*15 15*5 5*10 10*20 20*25
+    Matrix , OptimalSolution = MatrixChainOrder(array)
+
+    print("No. of Operation required: "+str((Matrix[1][n-1])))
+    PrintOptimalSolution(OptimalSolution,1,n-1)
+if __name__ == '__main__':
+    main()
diff --git a/hashes/chaos_machine.py b/hashes/chaos_machine.py
index 8b6c004380aa..f0a305bfeade 100644
--- a/hashes/chaos_machine.py
+++ b/hashes/chaos_machine.py
@@ -1,6 +1,11 @@
 """example of simple chaos machine"""
 from __future__ import print_function
 
+try:
+  input = raw_input  # Python 2
+except NameError:
+  pass               # Python 3
+
 # Chaos Machine (K, t, m)
 K = [0.33, 0.44, 0.55, 0.44, 0.33]; t = 3; m = 5
 
@@ -32,8 +37,8 @@ def push(seed):
       r # Saving to Parameters Space
 
   # Logistic Map
-  assert(max(buffer_space) < 1)
-  assert(max(params_space) < 4)
+  assert max(buffer_space) < 1
+  assert max(params_space) < 4
 
   # Machine Time
   machine_time += 1
@@ -91,7 +96,11 @@ def reset():
 for chunk in message:
   push(chunk)
 
+# for controlling 
+inp = ""
+
 # Pulling Data (Output)
-while True:
+while inp in ("e", "E"):
   print("%s" % format(pull(), '#04x'))
   print(buffer_space); print(params_space)
+  inp = input("(e)exit? ").strip()
diff --git a/hashes/md5.py b/hashes/md5.py
index c336b5fe49ee..d3f15510874e 100644
--- a/hashes/md5.py
+++ b/hashes/md5.py
@@ -2,6 +2,19 @@
 import math
 
 def rearrange(bitString32):
+	"""[summary]
+	Regroups the given binary string.
+	
+	Arguments:
+		bitString32 {[string]} -- [32 bit binary]
+	
+	Raises:
+		ValueError -- [if the given string not are 32 bit binary string]
+	
+	Returns:
+		[string] -- [32 bit binary string]
+	"""
+
 	if len(bitString32) != 32:
 		raise ValueError("Need length 32")
 	newString = ""
@@ -10,6 +23,13 @@ def rearrange(bitString32):
 	return newString
 
 def reformatHex(i):
+	"""[summary]
+	Converts the given integer into 8-digit hex number.
+
+	Arguments:
+		i {[int]} -- [integer]
+	"""
+
 	hexrep = format(i,'08x')
 	thing = ""
 	for i in [3,2,1,0]:
@@ -17,6 +37,16 @@ def reformatHex(i):
 	return thing
 
 def pad(bitString):
+	"""[summary]
+	Fills up the binary string to a 512 bit binary string
+
+	Arguments:
+		bitString {[string]} -- [binary string]
+	
+	Returns:
+		[string] -- [binary string]
+	"""
+
 	startLength = len(bitString)
 	bitString += '1'
 	while len(bitString) % 512 != 448:
@@ -26,6 +56,15 @@ def pad(bitString):
 	return bitString
 
 def getBlock(bitString):
+	"""[summary]
+	Iterator:
+		Returns by each call a list of length 16 with the 32 bit
+		integer blocks. 
+
+	Arguments:
+		bitString {[string]} -- [binary string >= 512]
+	"""
+
 	currPos = 0
 	while currPos < len(bitString):
 		currPart = bitString[currPos:currPos+512]
@@ -34,6 +73,7 @@ def getBlock(bitString):
 			mySplits.append(int(rearrange(currPart[32*i:32*i+32]),2))
 		yield mySplits
 		currPos += 512
+
 def not32(i):
 	i_str = format(i,'032b')
 	new_str = ''
@@ -48,6 +88,13 @@ def leftrot32(i,s):
 	return (i << s) ^ (i >> (32-s))
 
 def md5me(testString):
+	"""[summary]
+	Returns a 32-bit hash code of the string 'testString'
+
+	Arguments:
+		testString {[string]} -- [message]
+	"""
+
 	bs =''
 	for i in testString:
 		bs += format(ord(i),'08b')
diff --git a/linear-algebra-python/README.md b/linear-algebra-python/README.md
new file mode 100644
index 000000000000..ebfcdab7b179
--- /dev/null
+++ b/linear-algebra-python/README.md
@@ -0,0 +1,74 @@
+# Linear algebra library for Python  
+
+This module contains some useful classes and functions for dealing with linear algebra in python 2.  
+
+---
+
+## Overview  
+
+- class Vector  
+    - This class represents a vector of arbitray size and operations on it.  
+
+    **Overview about the methods:**    
+        
+    - constructor(components : list) : init the vector  
+    - set(components : list) : changes the vector components.  
+    - __str__() : toString method  
+    - component(i : int): gets the i-th component (start by 0)  
+    - size() : gets the size of the vector (number of components)  
+    - euclidLength() : returns the eulidean length of the vector.  
+    - operator + : vector addition  
+    - operator - : vector subtraction  
+    - operator * : scalar multiplication and dot product  
+    - copy() : copies this vector and returns it.  
+    - changeComponent(pos,value) : changes the specified component.  
+
+- function zeroVector(dimension)  
+    - returns a zero vector of 'dimension'  
+- function unitBasisVector(dimension,pos)  
+    - returns a unit basis vector with a One at index 'pos' (indexing at 0)  
+- function axpy(scalar,vector1,vector2)  
+    - computes the axpy operation  
+- function randomVector(N,a,b)
+    - returns a random vector of size N, with random integer components between 'a' and 'b'.
+- class Matrix
+    - This class represents a matrix of arbitrary size and operations on it.
+
+    **Overview about the methods:**  
+    
+    -  __str__() : returns a string representation  
+    - operator * : implements the matrix vector multiplication  
+                   implements the matrix-scalar multiplication.  
+    - changeComponent(x,y,value) : changes the specified component.  
+    - component(x,y) : returns the specified component.  
+    - width() : returns the width of the matrix  
+    - height() : returns the height of the matrix  
+    - operator + : implements the matrix-addition.  
+    - operator - _ implements the matrix-subtraction  
+- function squareZeroMatrix(N)  
+    - returns a square zero-matrix of dimension NxN  
+- function randomMatrix(W,H,a,b)  
+    - returns a random matrix WxH with integer components between 'a' and 'b'  
+---
+
+## Documentation  
+
+The module is well documented. You can use the python in-built ```help(...)``` function.  
+For instance: ```help(Vector)``` gives you all information about the Vector-class.  
+Or ```help(unitBasisVector)``` gives you all information you needed about the  
+global function ```unitBasisVector(...)```. If you need informations about a certain  
+method you type ```help(CLASSNAME.METHODNAME)```.  
+
+---
+
+## Usage  
+
+You will find the module in the **src** directory its called ```lib.py```. You need to  
+import this module in your project. Alternative you can also use the file ```lib.pyc``` in python-bytecode.   
+
+---
+
+## Tests  
+
+In the **src** directory you also find the test-suite, its called ```tests.py```.  
+The test-suite uses the built-in python-test-framework **unittest**.  
diff --git a/linear-algebra-python/src/lib.py b/linear-algebra-python/src/lib.py
new file mode 100644
index 000000000000..66f27ff8946e
--- /dev/null
+++ b/linear-algebra-python/src/lib.py
@@ -0,0 +1,364 @@
+# -*- coding: utf-8 -*-
+"""
+Created on Mon Feb 26 14:29:11 2018
+
+@author: Christian Bender
+@license: MIT-license
+
+This module contains some useful classes and functions for dealing
+with linear algebra in python.
+
+Overview:
+
+- class Vector
+- function zeroVector(dimension)
+- function unitBasisVector(dimension,pos)
+- function axpy(scalar,vector1,vector2)
+- function randomVector(N,a,b)
+- class Matrix
+- function squareZeroMatrix(N)
+- function randomMatrix(W,H,a,b)
+"""
+
+
+import math
+import random
+
+
+class Vector(object):
+    """
+        This class represents a vector of arbitray size.
+        You need to give the vector components. 
+        
+        Overview about the methods:
+        
+        constructor(components : list) : init the vector
+        set(components : list) : changes the vector components.
+        __str__() : toString method
+        component(i : int): gets the i-th component (start by 0)
+        size() : gets the size of the vector (number of components)
+        euclidLength() : returns the eulidean length of the vector.
+        operator + : vector addition
+        operator - : vector subtraction
+        operator * : scalar multiplication and dot product
+        copy() : copies this vector and returns it.
+        changeComponent(pos,value) : changes the specified component.
+        TODO: compare-operator
+    """
+    def __init__(self,components):
+        """
+            input: components or nothing
+            simple constructor for init the vector
+        """
+        self.__components = components
+    def set(self,components):
+        """
+            input: new components
+            changes the components of the vector.
+            replace the components with newer one.
+        """
+        if len(components) > 0:
+            self.__components = components
+        else:
+            raise Exception("please give any vector")
+    def __str__(self):
+        """
+            returns a string representation of the vector
+        """
+        ans = "("
+        length = len(self.__components)
+        for i in range(length):
+            if i != length-1:
+                ans += str(self.__components[i]) + ","
+            else:
+                ans += str(self.__components[i]) + ")"
+        if len(ans) == 1:
+            ans += ")"
+        return ans
+    def component(self,i):
+        """
+            input: index (start at 0)
+            output: the i-th component of the vector.
+        """
+        if i < len(self.__components) and i >= 0:
+            return self.__components[i]
+        else:
+            raise Exception("index out of range")
+    def size(self):
+        """
+            returns the size of the vector
+        """
+        return len(self.__components)
+    def eulidLength(self):
+        """
+            returns the eulidean length of the vector
+        """
+        summe = 0
+        for c in self.__components:
+            summe += c**2
+        return math.sqrt(summe)
+    def __add__(self,other):
+        """
+            input: other vector
+            assumes: other vector has the same size
+            returns a new vector that represents the sum.
+        """
+        size = self.size()
+        result = []
+        if size == other.size():
+            for i in range(size):
+                result.append(self.__components[i] + other.component(i))
+        else:
+            raise Exception("must have the same size")
+        return Vector(result)
+    def __sub__(self,other):
+        """
+            input: other vector
+            assumes: other vector has the same size
+            returns a new vector that represents the differenz.
+        """
+        size = self.size()
+        result = []
+        if size == other.size():
+            for i in range(size):
+                result.append(self.__components[i] - other.component(i))
+        else: # error case
+            raise Exception("must have the same size")
+        return Vector(result)
+    def __mul__(self,other):
+        """
+            mul implements the scalar multiplication 
+            and the dot-product
+        """
+        ans = []
+        if isinstance(other,float) or isinstance(other,int):
+            for c in self.__components:
+                ans.append(c*other)
+        elif (isinstance(other,Vector) and (self.size() == other.size())):
+            size = self.size()
+            summe = 0
+            for i in range(size):
+                summe += self.__components[i] * other.component(i)
+            return summe
+        else: # error case
+            raise Exception("invalide operand!")
+        return Vector(ans)
+    def copy(self):
+        """
+            copies this vector and returns it.
+        """
+        components = [x for x in self.__components]
+        return Vector(components)
+    def changeComponent(self,pos,value):
+        """
+            input: an index (pos) and a value
+            changes the specified component (pos) with the
+            'value'
+        """
+        #precondition
+        assert (pos >= 0 and pos < len(self.__components))
+        self.__components[pos] = value
+    
+def zeroVector(dimension):
+    """
+        returns a zero-vector of size 'dimension'
+    """        
+    #precondition
+    assert(isinstance(dimension,int))
+    ans = []
+    for i in range(dimension):
+        ans.append(0)
+    return Vector(ans)
+
+
+def unitBasisVector(dimension,pos):
+    """
+        returns a unit basis vector with a One 
+        at index 'pos' (indexing at 0)
+    """
+    #precondition
+    assert(isinstance(dimension,int) and (isinstance(pos,int)))
+    ans = []
+    for i in range(dimension):
+        if i != pos:
+            ans.append(0)
+        else:
+            ans.append(1)
+    return Vector(ans)
+        
+
+def axpy(scalar,x,y):
+    """
+        input: a 'scalar' and two vectors 'x' and 'y'
+        output: a vector
+        computes the axpy operation
+    """
+    # precondition
+    assert(isinstance(x,Vector) and (isinstance(y,Vector)) \
+    and (isinstance(scalar,int) or isinstance(scalar,float)))
+    return (x*scalar + y)
+    
+
+def randomVector(N,a,b):
+    """
+        input: size (N) of the vector.
+               random range (a,b)
+        output: returns a random vector of size N, with 
+                random integer components between 'a' and 'b'.
+    """
+    ans = zeroVector(N)
+    random.seed(None)
+    for i in range(N):
+        ans.changeComponent(i,random.randint(a,b))
+    return ans
+
+
+class Matrix(object):
+    """
+    class: Matrix
+    This class represents a arbitrary matrix.
+    
+    Overview about the methods:
+    
+         __str__() : returns a string representation 
+           operator * : implements the matrix vector multiplication
+                        implements the matrix-scalar multiplication.
+           changeComponent(x,y,value) : changes the specified component.
+           component(x,y) : returns the specified component.
+           width() : returns the width of the matrix
+           height() : returns the height of the matrix
+           operator + : implements the matrix-addition.
+           operator - _ implements the matrix-subtraction
+    """
+    def __init__(self,matrix,w,h):
+        """
+            simple constructor for initialzes 
+            the matrix with components.
+        """
+        self.__matrix = matrix
+        self.__width = w
+        self.__height = h
+    def __str__(self):
+        """
+            returns a string representation of this
+            matrix.
+        """
+        ans = ""
+        for i in range(self.__height):
+            ans += "|"
+            for j in range(self.__width):
+                if j < self.__width -1:
+                    ans += str(self.__matrix[i][j]) + ","
+                else:
+                    ans += str(self.__matrix[i][j]) + "|\n"
+        return ans
+    def changeComponent(self,x,y, value):
+        """
+            changes the x-y component of this matrix
+        """
+        if x >= 0 and x < self.__height and y >= 0 and y < self.__width:
+            self.__matrix[x][y] = value
+        else:
+            raise Exception ("changeComponent: indices out of bounds")
+    def component(self,x,y):
+        """
+            returns the specified (x,y) component
+        """
+        if x >= 0 and x < self.__height and y >= 0 and y < self.__width:
+            return self.__matrix[x][y]
+        else:
+            raise Exception ("changeComponent: indices out of bounds")
+    def width(self):
+        """
+            getter for the width
+        """
+        return self.__width
+    def height(self):
+        """
+            getter for the height
+        """
+        return self.__height
+    def __mul__(self,other):
+        """
+            implements the matrix-vector multiplication.
+            implements the matrix-scalar multiplication
+        """
+        if isinstance(other, Vector): # vector-matrix 
+            if (other.size() == self.__width):
+                ans = zeroVector(self.__height)
+                for i in range(self.__height):
+                    summe = 0
+                    for j in range(self.__width):
+                        summe += other.component(j) * self.__matrix[i][j]
+                    ans.changeComponent(i,summe)
+                    summe = 0
+                return ans
+            else:
+                raise Exception("vector must have the same size as the "
+                + "number of columns of the matrix!")
+        elif isinstance(other,int) or isinstance(other,float): # matrix-scalar
+            matrix = []
+            for i in range(self.__height):
+                row = []
+                for j in range(self.__width):
+                    row.append(self.__matrix[i][j] * other)
+                matrix.append(row)
+            return Matrix(matrix,self.__width,self.__height)
+    def __add__(self,other):
+        """
+            implements the matrix-addition.
+        """
+        if (self.__width == other.width() and self.__height == other.height()):
+            matrix = []
+            for i in range(self.__height):
+                row = []
+                for j in range(self.__width):
+                    row.append(self.__matrix[i][j] + other.component(i,j))
+                matrix.append(row)
+            return Matrix(matrix,self.__width,self.__height)
+        else:
+            raise Exception("matrix must have the same dimension!")
+    def __sub__(self,other):
+        """
+            implements the matrix-subtraction.
+        """
+        if (self.__width == other.width() and self.__height == other.height()):
+            matrix = []
+            for i in range(self.__height):
+                row = []
+                for j in range(self.__width):
+                    row.append(self.__matrix[i][j] - other.component(i,j))
+                matrix.append(row)
+            return Matrix(matrix,self.__width,self.__height)
+        else:
+            raise Exception("matrix must have the same dimension!")
+    
+
+def squareZeroMatrix(N):
+    """
+        returns a square zero-matrix of dimension NxN
+    """
+    ans = []
+    for i in range(N):
+        row = []
+        for j in range(N):
+            row.append(0)
+        ans.append(row)
+    return Matrix(ans,N,N)
+    
+    
+def randomMatrix(W,H,a,b):
+    """
+        returns a random matrix WxH with integer components
+        between 'a' and 'b'
+    """
+    matrix = []
+    random.seed(None)
+    for i in range(H):
+        row = []
+        for j in range(W):
+            row.append(random.randint(a,b))
+        matrix.append(row)
+    return Matrix(matrix,W,H)
+            
+        
\ No newline at end of file
diff --git a/linear-algebra-python/src/lib.pyc b/linear-algebra-python/src/lib.pyc
new file mode 100644
index 000000000000..7aeca0e1c6d5
Binary files /dev/null and b/linear-algebra-python/src/lib.pyc differ
diff --git a/linear-algebra-python/src/tests.py b/linear-algebra-python/src/tests.py
new file mode 100644
index 000000000000..b84612b4ced4
--- /dev/null
+++ b/linear-algebra-python/src/tests.py
@@ -0,0 +1,133 @@
+# -*- coding: utf-8 -*-
+"""
+Created on Mon Feb 26 15:40:07 2018
+
+@author: Christian Bender
+@license: MIT-license
+
+This file contains the test-suite for the linear algebra library.
+"""
+
+import unittest
+from lib import *
+
+class Test(unittest.TestCase):
+    def test_component(self):
+        """
+            test for method component
+        """
+        x = Vector([1,2,3])
+        self.assertEqual(x.component(0),1)
+        self.assertEqual(x.component(2),3)
+        try:
+            y = Vector()
+            self.assertTrue(False)
+        except:
+            self.assertTrue(True)
+    def test_str(self):
+        """
+            test for toString() method
+        """
+        x = Vector([0,0,0,0,0,1])
+        self.assertEqual(x.__str__(),"(0,0,0,0,0,1)")
+    def test_size(self):
+        """
+            test for size()-method
+        """
+        x = Vector([1,2,3,4])
+        self.assertEqual(x.size(),4)
+    def test_euclidLength(self):
+        """
+            test for the eulidean length
+        """
+        x = Vector([1,2])
+        self.assertAlmostEqual(x.eulidLength(),2.236,3)
+    def test_add(self):
+        """
+            test for + operator
+        """
+        x = Vector([1,2,3])
+        y = Vector([1,1,1])
+        self.assertEqual((x+y).component(0),2)
+        self.assertEqual((x+y).component(1),3)
+        self.assertEqual((x+y).component(2),4)
+    def test_sub(self):
+        """
+            test for - operator
+        """
+        x = Vector([1,2,3])
+        y = Vector([1,1,1])
+        self.assertEqual((x-y).component(0),0)
+        self.assertEqual((x-y).component(1),1)
+        self.assertEqual((x-y).component(2),2)
+    def test_mul(self):
+        """
+            test for * operator
+        """
+        x = Vector([1,2,3])
+        a = Vector([2,-1,4]) # for test of dot-product
+        b = Vector([1,-2,-1])
+        self.assertEqual((x*3.0).__str__(),"(3.0,6.0,9.0)")
+        self.assertEqual((a*b),0)
+    def test_zeroVector(self):
+        """
+            test for the global function zeroVector(...)
+        """
+        self.assertTrue(zeroVector(10).__str__().count("0") == 10)
+    def test_unitBasisVector(self):
+        """
+            test for the global function unitBasisVector(...)
+        """
+        self.assertEqual(unitBasisVector(3,1).__str__(),"(0,1,0)")
+    def test_axpy(self):
+        """
+            test for the global function axpy(...) (operation)
+        """
+        x = Vector([1,2,3])
+        y = Vector([1,0,1])
+        self.assertEqual(axpy(2,x,y).__str__(),"(3,4,7)")
+    def test_copy(self):
+        """
+            test for the copy()-method
+        """
+        x = Vector([1,0,0,0,0,0])
+        y = x.copy()
+        self.assertEqual(x.__str__(),y.__str__())
+    def test_changeComponent(self):
+        """
+            test for the changeComponent(...)-method
+        """
+        x = Vector([1,0,0])
+        x.changeComponent(0,0)
+        x.changeComponent(1,1)
+        self.assertEqual(x.__str__(),"(0,1,0)")
+    def test_str_matrix(self):
+        A = Matrix([[1,2,3],[2,4,5],[6,7,8]],3,3)
+        self.assertEqual("|1,2,3|\n|2,4,5|\n|6,7,8|\n",A.__str__())
+    def test__mul__matrix(self):
+        A = Matrix([[1,2,3],[4,5,6],[7,8,9]],3,3)
+        x = Vector([1,2,3])
+        self.assertEqual("(14,32,50)",(A*x).__str__())
+        self.assertEqual("|2,4,6|\n|8,10,12|\n|14,16,18|\n",(A*2).__str__())
+    def test_changeComponent_matrix(self):
+        A = Matrix([[1,2,3],[2,4,5],[6,7,8]],3,3)
+        A.changeComponent(0,2,5)
+        self.assertEqual("|1,2,5|\n|2,4,5|\n|6,7,8|\n",A.__str__())
+    def test_component_matrix(self):
+        A = Matrix([[1,2,3],[2,4,5],[6,7,8]],3,3)
+        self.assertEqual(7,A.component(2,1),0.01)
+    def test__add__matrix(self):
+        A = Matrix([[1,2,3],[2,4,5],[6,7,8]],3,3)
+        B = Matrix([[1,2,7],[2,4,5],[6,7,10]],3,3)
+        self.assertEqual("|2,4,10|\n|4,8,10|\n|12,14,18|\n",(A+B).__str__())
+    def test__sub__matrix(self):
+        A = Matrix([[1,2,3],[2,4,5],[6,7,8]],3,3)
+        B = Matrix([[1,2,7],[2,4,5],[6,7,10]],3,3)
+        self.assertEqual("|0,0,-4|\n|0,0,0|\n|0,0,-2|\n",(A-B).__str__())
+    def test_squareZeroMatrix(self):
+        self.assertEqual('|0,0,0,0,0|\n|0,0,0,0,0|\n|0,0,0,0,0|\n|0,0,0,0,0|' 
+        +'\n|0,0,0,0,0|\n',squareZeroMatrix(5).__str__())
+        
+
+if __name__ == "__main__":
+    unittest.main()
\ No newline at end of file
diff --git a/machine_learning/scoring_functions.py b/machine_learning/scoring_functions.py
index 861d45c1f210..a2d97b09ded2 100755
--- a/machine_learning/scoring_functions.py
+++ b/machine_learning/scoring_functions.py
@@ -70,9 +70,9 @@ def mbd(predict, actual):
     difference = predict - actual
     numerator = np.sum(difference) / len(predict) 
     denumerator =  np.sum(actual) / len(predict)
-    print str(numerator)
-    print str(denumerator)
+    print(numerator)
+    print(denumerator)
 
     score = float(numerator) / denumerator * 100
 
-    return score
\ No newline at end of file
+    return score
diff --git a/networking_flow/Ford_Fulkerson.py b/networking_flow/Ford_Fulkerson.py
new file mode 100644
index 000000000000..d51f1f0661b3
--- /dev/null
+++ b/networking_flow/Ford_Fulkerson.py
@@ -0,0 +1,56 @@
+# Ford-Fulkerson Algorithm for Maximum Flow Problem
+"""
+Description:
+    (1) Start with initial flow as 0;
+    (2) Choose augmenting path from source to sink and add path to flow;
+"""
+    
+def BFS(graph, s, t, parent):
+    # Return True if there is node that has not iterated.
+    visited = [False]*len(graph)
+    queue=[]
+    queue.append(s)
+    visited[s] = True
+    
+    while queue:
+        u = queue.pop(0)
+        for ind in range(len(graph[u])):
+            if visited[ind] == False and graph[u][ind] > 0:
+                queue.append(ind)
+                visited[ind] = True
+                parent[ind] = u
+
+    return True if visited[t] else False
+     
+def FordFulkerson(graph, source, sink):
+    # This array is filled by BFS and to store path
+    parent = [-1]*(len(graph))
+    max_flow = 0 
+    while BFS(graph, source, sink, parent) :
+        path_flow = float("Inf")
+        s = sink
+
+        while(s !=  source):
+            # Find the minimum value in select path
+            path_flow = min (path_flow, graph[parent[s]][s])
+            s = parent[s]
+
+        max_flow +=  path_flow
+        v = sink
+
+        while(v !=  source):
+            u = parent[v]
+            graph[u][v] -= path_flow
+            graph[v][u] += path_flow
+            v = parent[v]
+    return max_flow
+
+graph = [[0, 16, 13, 0, 0, 0],
+         [0, 0, 10 ,12, 0, 0],
+         [0, 4, 0, 0, 14, 0],
+         [0, 0, 9, 0, 0, 20],
+         [0, 0, 0, 7, 0, 4],
+         [0, 0, 0, 0, 0, 0]]
+
+source, sink = 0, 5
+print(FordFulkerson(graph, source, sink))
\ No newline at end of file
diff --git a/networking_flow/Minimum_cut.py b/networking_flow/Minimum_cut.py
new file mode 100644
index 000000000000..8ad6e03b00c6
--- /dev/null
+++ b/networking_flow/Minimum_cut.py
@@ -0,0 +1,59 @@
+# Minimum cut on Ford_Fulkerson algorithm.
+    
+def BFS(graph, s, t, parent):
+    # Return True if there is node that has not iterated.
+    visited = [False]*len(graph)
+    queue=[]
+    queue.append(s)
+    visited[s] = True
+    
+    while queue:
+        u = queue.pop(0)
+        for ind in range(len(graph[u])):
+            if visited[ind] == False and graph[u][ind] > 0:
+                queue.append(ind)
+                visited[ind] = True
+                parent[ind] = u
+
+    return True if visited[t] else False
+ 
+def mincut(graph, source, sink):
+    # This array is filled by BFS and to store path
+    parent = [-1]*(len(graph))
+    max_flow = 0 
+    res = []
+    temp = [i[:] for i in graph]   # Record orignial cut, copy.
+    while BFS(graph, source, sink, parent) :
+        path_flow = float("Inf")
+        s = sink
+
+        while(s !=  source):
+            # Find the minimum value in select path
+            path_flow = min (path_flow, graph[parent[s]][s])
+            s = parent[s]
+
+        max_flow +=  path_flow
+        v = sink
+        
+        while(v !=  source):
+            u = parent[v]
+            graph[u][v] -= path_flow
+            graph[v][u] += path_flow
+            v = parent[v]
+
+    for i in range(len(graph)):
+        for j in range(len(graph[0])):
+            if graph[i][j] == 0 and temp[i][j] > 0:
+                res.append((i,j))
+
+    return res
+
+graph = [[0, 16, 13, 0, 0, 0],
+         [0, 0, 10 ,12, 0, 0],
+         [0, 4, 0, 0, 14, 0],
+         [0, 0, 9, 0, 0, 20],
+         [0, 0, 0, 7, 0, 4],
+         [0, 0, 0, 0, 0, 0]]
+
+source, sink = 0, 5
+print(mincut(graph, source, sink))
\ No newline at end of file
diff --git a/other/Fischer-Yates_Shuffle.py b/other/Fischer-Yates_Shuffle.py
new file mode 100644
index 000000000000..28cdff75ab85
--- /dev/null
+++ b/other/Fischer-Yates_Shuffle.py
@@ -0,0 +1,20 @@
+'''
+The Fisher–Yates shuffle is an algorithm for generating a random permutation of a finite sequence.
+For more details visit
+wikipedia/Fischer-Yates-Shuffle.
+'''
+import random
+
+def FYshuffle(LIST):
+    for i in range(len(LIST)):
+        a = random.randint(0, len(LIST)-1)
+        b = random.randint(0, len(LIST)-1)
+        LIST[a], LIST[b] = LIST[b], LIST[a]
+    return LIST
+
+if __name__ == '__main__':
+    integers = [0,1,2,3,4,5,6,7]
+    strings = ['python', 'says', 'hello', '!']
+    print ('Fisher-Yates Shuffle:')
+    print ('List',integers, strings)
+    print ('FY Shuffle',FYshuffle(integers), FYshuffle(strings))
diff --git a/searches/binary_search.py b/searches/binary_search.py
index 93bf189cc08f..7df45883c09a 100644
--- a/searches/binary_search.py
+++ b/searches/binary_search.py
@@ -110,6 +110,9 @@ def binary_search_by_recursion(sorted_collection, item, left, right):
     >>> binary_search_std_lib([0, 5, 7, 10, 15], 6)
 
     """
+    if (right < left):
+        return None
+    
     midpoint = left + (right - left) // 2
 
     if sorted_collection[midpoint] == item:
diff --git a/searches/jump_search.py b/searches/jump_search.py
index 4cff92bb585c..10cb933f2f35 100644
--- a/searches/jump_search.py
+++ b/searches/jump_search.py
@@ -2,11 +2,11 @@
 import math
 def jump_search(arr, x):
     n = len(arr)
-    step = math.floor(math.sqrt(n))
+    step = int(math.floor(math.sqrt(n)))
     prev = 0
     while arr[min(step, n)-1] < x:
         prev = step
-        step += math.floor(math.sqrt(n))
+        step += int(math.floor(math.sqrt(n)))
         if prev >= n:
             return -1
 
@@ -23,4 +23,4 @@ def jump_search(arr, x):
 arr = [ 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610]
 x = 55
 index = jump_search(arr, x)
-print("\nNumber " + str(x) +" is at index " + str(index));
\ No newline at end of file
+print("\nNumber " + str(x) +" is at index " + str(index));
diff --git a/searches/tabuTestData.txt b/searches/tabuTestData.txt
new file mode 100644
index 000000000000..f797ff1c627a
--- /dev/null
+++ b/searches/tabuTestData.txt
@@ -0,0 +1,10 @@
+a b 20
+a c 18
+a d 22
+a e 26
+b c 10
+b d 11
+b e 12
+c d 23
+c e 24
+d e 40
diff --git a/searches/tabu_search.py b/searches/tabu_search.py
new file mode 100644
index 000000000000..74c23f8b8cf1
--- /dev/null
+++ b/searches/tabu_search.py
@@ -0,0 +1,254 @@
+"""
+This is pure python implementation of Tabu search algorithm for a Travelling Salesman Problem, that the distances
+between the cities are symmetric (the distance between city 'a' and city 'b' is the same between city 'b' and city 'a').
+The TSP can be represented into a graph. The cities are represented by nodes and the distance between them is
+represented by the weight of the ark between the nodes.
+
+The .txt file with the graph has the form:
+
+node1 node2 distance_between_node1_and_node2
+node1 node3 distance_between_node1_and_node3
+...
+
+Be careful node1, node2 and the distance between them, must exist only once. This means in the .txt file
+should not exist:
+node1 node2 distance_between_node1_and_node2
+node2 node1 distance_between_node2_and_node1
+
+For pytests run following command:
+pytest
+
+For manual testing run:
+python tabu_search.py -f your_file_name.txt -number_of_iterations_of_tabu_search -s size_of_tabu_search
+e.g. python tabu_search.py -f tabudata2.txt -i 4 -s 3
+"""
+
+import copy
+import argparse
+import sys
+
+
+def generate_neighbours(path):
+    """
+    Pure implementation of generating a dictionary of neighbors and the cost with each
+    neighbor, given a path file that includes a graph.
+
+    :param path: The path to the .txt file that includes the graph (e.g.tabudata2.txt)
+    :return dict_of_neighbours: Dictionary with key each node and value a list of lists with the neighbors of the node
+    and the cost (distance) for each neighbor.
+
+    Example of dict_of_neighbours:
+    >>> dict_of_neighbours[a]
+    [[b,20],[c,18],[d,22],[e,26]]
+
+    This indicates the neighbors of node (city) 'a', which has neighbor the node 'b' with distance 20,
+    the node 'c' with distance 18, the node 'd' with distance 22 and the node 'e' with distance 26.
+
+    """
+    f = open(path, "r")
+
+    dict_of_neighbours = {}
+
+    for line in f:
+        if line.split()[0] not in dict_of_neighbours:
+            _list = list()
+            _list.append([line.split()[1], line.split()[2]])
+            dict_of_neighbours[line.split()[0]] = _list
+        else:
+            dict_of_neighbours[line.split()[0]].append([line.split()[1], line.split()[2]])
+        if line.split()[1] not in dict_of_neighbours:
+            _list = list()
+            _list.append([line.split()[0], line.split()[2]])
+            dict_of_neighbours[line.split()[1]] = _list
+        else:
+            dict_of_neighbours[line.split()[1]].append([line.split()[0], line.split()[2]])
+    f.close()
+
+    return dict_of_neighbours
+
+
+def generate_first_solution(path, dict_of_neighbours):
+    """
+    Pure implementation of generating the first solution for the Tabu search to start, with the redundant resolution
+    strategy. That means that we start from the starting node (e.g. node 'a'), then we go to the city nearest (lowest
+    distance) to this node (let's assume is node 'c'), then we go to the nearest city of the node 'c', etc
+    till we have visited all cities and return to the starting node.
+
+    :param path: The path to the .txt file that includes the graph (e.g.tabudata2.txt)
+    :param dict_of_neighbours: Dictionary with key each node and value a list of lists with the neighbors of the node
+    and the cost (distance) for each neighbor.
+    :return first_solution: The solution for the first iteration of Tabu search using the redundant resolution strategy
+    in a list.
+    :return distance_of_first_solution: The total distance that Travelling Salesman will travel, if he follows the path
+    in first_solution.
+
+    """
+
+    f = open(path, "r")
+    start_node = f.read(1)
+    end_node = start_node
+
+    first_solution = []
+
+    visiting = start_node
+
+    distance_of_first_solution = 0
+    f.close()
+    while visiting not in first_solution:
+        minim = 10000
+        for k in dict_of_neighbours[visiting]:
+            if int(k[1]) < int(minim) and k[0] not in first_solution:
+                minim = k[1]
+                best_node = k[0]
+
+        first_solution.append(visiting)
+        distance_of_first_solution = distance_of_first_solution + int(minim)
+        visiting = best_node
+
+    first_solution.append(end_node)
+
+    position = 0
+    for k in dict_of_neighbours[first_solution[-2]]:
+        if k[0] == start_node:
+            break
+        position += 1
+
+    distance_of_first_solution = distance_of_first_solution + int(
+        dict_of_neighbours[first_solution[-2]][position][1]) - 10000
+    return first_solution, distance_of_first_solution
+
+
+def find_neighborhood(solution, dict_of_neighbours):
+    """
+    Pure implementation of generating the neighborhood (sorted by total distance of each solution from
+    lowest to highest) of a solution with 1-1 exchange method, that means we exchange each node in a solution with each
+    other node and generating a number of solution named neighborhood.
+
+    :param solution: The solution in which we want to find the neighborhood.
+    :param dict_of_neighbours: Dictionary with key each node and value a list of lists with the neighbors of the node
+    and the cost (distance) for each neighbor.
+    :return neighborhood_of_solution: A list that includes the solutions and the total distance of each solution
+    (in form of list) that are produced with 1-1 exchange from the solution that the method took as an input
+
+
+    Example:
+    >>> find_neighborhood(['a','c','b','d','e','a'])
+    [['a','e','b','d','c','a',90], [['a','c','d','b','e','a',90],['a','d','b','c','e','a',93],
+    ['a','c','b','e','d','a',102], ['a','c','e','d','b','a',113], ['a','b','c','d','e','a',93]]
+
+    """
+
+    neighborhood_of_solution = []
+
+    for n in solution[1:-1]:
+        idx1 = solution.index(n)
+        for kn in solution[1:-1]:
+            idx2 = solution.index(kn)
+            if n == kn:
+                continue
+
+            _tmp = copy.deepcopy(solution)
+            _tmp[idx1] = kn
+            _tmp[idx2] = n
+
+            distance = 0
+
+            for k in _tmp[:-1]:
+                next_node = _tmp[_tmp.index(k) + 1]
+                for i in dict_of_neighbours[k]:
+                    if i[0] == next_node:
+                        distance = distance + int(i[1])
+            _tmp.append(distance)
+
+            if _tmp not in neighborhood_of_solution:
+                neighborhood_of_solution.append(_tmp)
+
+    indexOfLastItemInTheList = len(neighborhood_of_solution[0]) - 1
+
+    neighborhood_of_solution.sort(key=lambda x: x[indexOfLastItemInTheList])
+    return neighborhood_of_solution
+
+
+def tabu_search(first_solution, distance_of_first_solution, dict_of_neighbours, iters, size):
+    """
+    Pure implementation of Tabu search algorithm for a Travelling Salesman Problem in Python.
+
+    :param first_solution: The solution for the first iteration of Tabu search using the redundant resolution strategy
+    in a list.
+    :param distance_of_first_solution: The total distance that Travelling Salesman will travel, if he follows the path
+    in first_solution.
+    :param dict_of_neighbours: Dictionary with key each node and value a list of lists with the neighbors of the node
+    and the cost (distance) for each neighbor.
+    :param iters: The number of iterations that Tabu search will execute.
+    :param size: The size of Tabu List.
+    :return best_solution_ever: The solution with the lowest distance that occured during the execution of Tabu search.
+    :return best_cost: The total distance that Travelling Salesman will travel, if he follows the path in best_solution
+    ever.
+
+    """
+    count = 1
+    solution = first_solution
+    tabu_list = list()
+    best_cost = distance_of_first_solution
+    best_solution_ever = solution
+
+    while count <= iters:
+        neighborhood = find_neighborhood(solution, dict_of_neighbours)
+        index_of_best_solution = 0
+        best_solution = neighborhood[index_of_best_solution]
+        best_cost_index = len(best_solution) - 1
+
+        found = False
+        while found is False:
+            i = 0
+            while i < len(best_solution):
+
+                if best_solution[i] != solution[i]:
+                    first_exchange_node = best_solution[i]
+                    second_exchange_node = solution[i]
+                    break
+                i = i + 1
+
+            if [first_exchange_node, second_exchange_node] not in tabu_list and [second_exchange_node,
+                                                                                 first_exchange_node] not in tabu_list:
+                tabu_list.append([first_exchange_node, second_exchange_node])
+                found = True
+                solution = best_solution[:-1]
+                cost = neighborhood[index_of_best_solution][best_cost_index]
+                if cost < best_cost:
+                    best_cost = cost
+                    best_solution_ever = solution
+            else:
+                index_of_best_solution = index_of_best_solution + 1
+                best_solution = neighborhood[index_of_best_solution]
+
+        if len(tabu_list) >= size:
+            tabu_list.pop(0)
+
+        count = count + 1
+
+    return best_solution_ever, best_cost
+
+
+def main(args=None):
+    dict_of_neighbours = generate_neighbours(args.File)
+
+    first_solution, distance_of_first_solution = generate_first_solution(args.File, dict_of_neighbours)
+
+    best_sol, best_cost = tabu_search(first_solution, distance_of_first_solution, dict_of_neighbours, args.Iterations,
+                                      args.Size)
+
+    print("Best solution: {0}, with total distance: {1}.".format(best_sol, best_cost))
+
+
+if __name__ == "__main__":
+    parser = argparse.ArgumentParser(description="Tabu Search")
+    parser.add_argument(
+        "-f", "--File", type=str, help="Path to the file containing the data", required=True)
+    parser.add_argument(
+        "-i", "--Iterations", type=int, help="How many iterations the algorithm should perform", required=True)
+    parser.add_argument(
+        "-s", "--Size", type=int, help="Size of the tabu list", required=True)
+
+    # Pass the arguments to main method
+    sys.exit(main(parser.parse_args()))
diff --git a/searches/test_tabu_search.py b/searches/test_tabu_search.py
new file mode 100644
index 000000000000..1bc2d33612ff
--- /dev/null
+++ b/searches/test_tabu_search.py
@@ -0,0 +1,46 @@
+import unittest
+import os
+from tabu_search import generate_neighbours, generate_first_solution, find_neighborhood, tabu_search
+
+TEST_FILE = os.path.join(os.path.dirname(__file__), './tabuTestData.txt')
+
+NEIGHBOURS_DICT = {'a': [['b', '20'], ['c', '18'], ['d', '22'], ['e', '26']],
+                   'c': [['a', '18'], ['b', '10'], ['d', '23'], ['e', '24']],
+                   'b': [['a', '20'], ['c', '10'], ['d', '11'], ['e', '12']],
+                   'e': [['a', '26'], ['b', '12'], ['c', '24'], ['d', '40']],
+                   'd': [['a', '22'], ['b', '11'], ['c', '23'], ['e', '40']]}
+
+FIRST_SOLUTION = ['a', 'c', 'b', 'd', 'e', 'a']
+
+DISTANCE = 105
+
+NEIGHBOURHOOD_OF_SOLUTIONS = [['a', 'e', 'b', 'd', 'c', 'a', 90],
+                              ['a', 'c', 'd', 'b', 'e', 'a', 90],
+                              ['a', 'd', 'b', 'c', 'e', 'a', 93],
+                              ['a', 'c', 'b', 'e', 'd', 'a', 102],
+                              ['a', 'c', 'e', 'd', 'b', 'a', 113],
+                              ['a', 'b', 'c', 'd', 'e', 'a', 119]]
+
+
+class TestClass(unittest.TestCase):
+    def test_generate_neighbours(self):
+        neighbours = generate_neighbours(TEST_FILE)
+
+        self.assertEquals(NEIGHBOURS_DICT, neighbours)
+
+    def test_generate_first_solutions(self):
+        first_solution, distance = generate_first_solution(TEST_FILE, NEIGHBOURS_DICT)
+
+        self.assertEquals(FIRST_SOLUTION, first_solution)
+        self.assertEquals(DISTANCE, distance)
+
+    def test_find_neighbours(self):
+        neighbour_of_solutions = find_neighborhood(FIRST_SOLUTION, NEIGHBOURS_DICT)
+
+        self.assertEquals(NEIGHBOURHOOD_OF_SOLUTIONS, neighbour_of_solutions)
+
+    def test_tabu_search(self):
+        best_sol, best_cost = tabu_search(FIRST_SOLUTION, DISTANCE, NEIGHBOURS_DICT, 4, 3)
+
+        self.assertEquals(['a', 'd', 'b', 'e', 'c', 'a'], best_sol)
+        self.assertEquals(87, best_cost)
\ No newline at end of file
diff --git a/server.py b/server.py
deleted file mode 100644
index 578c24285bfb..000000000000
--- a/server.py
+++ /dev/null
@@ -1,43 +0,0 @@
-# all imports - including #s
-import socket
-#import os
-#import sys
-#import subprocess
-# end of imports
-# the below classes will clarify what information is for the attacker and client
-class Termrequire:
-    host = socket.gethostname()
-    port = 3333 # fake numeral for the moment
-class Clientrequire:
-    host = socket.gethostname()
-    port = 2222 # fake numeral for the moment
-#CORE REQUIREMENTS OF PROGRAM:
-### host ip = server ip
-### potential connection hosts info (host, port)
-### user.config
-### user.config
-# using SERVER for connections and linux meterpreter sessions
-# SERVER DETAILS:
-    #5 client availability for pivoting #although that is not yet available in a regular form of
-    #exploitation  - we have to go with what we have.
-
-# #learnmore - USER_CONFIG
-# server ip will be displayed every connection at version 2.0
-# terminal attacker socket object creation
-t = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
-# terminal attacker socket binding
-t.bind()
-# terminal attacker socket listen
-t.listen()
-#  client socket object creation
-s = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
-# binding information with s.bind method
-s.bind()
-#listening for connections with s.listen method
-s.listen(1)
-# server_functionality waits for terminal shell and then gets client information connectivity
-def func4client():
-    s.accept()
-# terminal functionality for attacker - I will definitely customize it soon. Maybe tkinter?
-def func4term():
-    t.accept()
\ No newline at end of file
diff --git a/simple-client-server/README.md b/simple-client-server/README.md
new file mode 100644
index 000000000000..f51947f2105a
--- /dev/null
+++ b/simple-client-server/README.md
@@ -0,0 +1,6 @@
+# simple client server
+
+#### Note:
+- Run **`server.py`** first.
+- Now, run **`client.py`**.
+- verify the output.
diff --git a/simple-client-server/client.py b/simple-client-server/client.py
new file mode 100644
index 000000000000..c91e6233ad16
--- /dev/null
+++ b/simple-client-server/client.py
@@ -0,0 +1,14 @@
+# client.py
+
+import socket
+
+HOST, PORT = '127.0.0.1', 1400
+
+s = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
+s.connect((HOST, PORT))
+
+s.send(b'Hello World')
+data = s.recv(1024)
+
+s.close()
+print(repr(data.decode('ascii')))
diff --git a/simple-client-server/server.py b/simple-client-server/server.py
new file mode 100644
index 000000000000..c6b661d99044
--- /dev/null
+++ b/simple-client-server/server.py
@@ -0,0 +1,21 @@
+# server.py
+
+import socket
+
+HOST, PORT = '127.0.0.1', 1400
+
+s = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
+s.bind((HOST, PORT))
+s.listen(1)
+
+conn, addr = s.accept()
+
+print('connected to:', addr)
+
+while 1:
+    data = conn.recv(1024)
+    if not data:
+        break
+    conn.send(data + b' [ addition by server ]')
+        
+conn.close()
diff --git a/sorts/bogosort.py b/sorts/bogosort.py
index 2a3d320b00f0..33eac66bf21c 100644
--- a/sorts/bogosort.py
+++ b/sorts/bogosort.py
@@ -44,6 +44,6 @@ def isSorted(collection):
     except NameError:
         raw_input = input  # Python 3
 
-    user_input = raw_input('Enter numbers separated by a comma:\n').stript()
+    user_input = raw_input('Enter numbers separated by a comma:\n').strip()
     unsorted = [int(item) for item in user_input.split(',')]
     print(bogosort(unsorted))
diff --git a/sorts/bubble_sort.py b/sorts/bubble_sort.py
index e1bdf318911d..e28e7aa4fbe2 100644
--- a/sorts/bubble_sort.py
+++ b/sorts/bubble_sort.py
@@ -32,10 +32,12 @@ def bubble_sort(collection):
     """
     length = len(collection)
     for i in range(length):
+        swapped = False
         for j in range(length-1):
             if collection[j] > collection[j+1]:
+                swapped = True
                 collection[j], collection[j+1] = collection[j+1], collection[j]
-
+        if not swapped: break  # Stop iteration if the collection is sorted.
     return collection
 
 
diff --git a/sorts/merge_sort_fastest.py b/sorts/merge_sort_fastest.py
new file mode 100644
index 000000000000..9fc9275aacba
--- /dev/null
+++ b/sorts/merge_sort_fastest.py
@@ -0,0 +1,19 @@
+'''
+Python implementation of merge sort algorithm.
+Takes an average of 0.6 microseconds to sort a list of length 1000 items.
+Best Case Scenario : O(n)
+Worst Case Scenario : O(n)
+'''
+def merge_sort(LIST):
+    start = []
+    end = []
+    while len(LIST) > 1:
+        a = min(LIST)
+        b = max(LIST)
+        start.append(a)
+        end.append(b)
+        LIST.remove(a)
+        LIST.remove(b)
+    if LIST: start.append(LIST[0])
+    end.reverse()
+    return (start + end)
diff --git a/sorts/pancake_sort.py b/sorts/pancake_sort.py
new file mode 100644
index 000000000000..26fd40b7f67c
--- /dev/null
+++ b/sorts/pancake_sort.py
@@ -0,0 +1,16 @@
+# Pancake sort algorithm 
+# Only can reverse array from 0 to i
+
+def pancakesort(arr):
+    cur = len(arr)
+    while cur > 1:
+        # Find the maximum number in arr
+        mi = arr.index(max(arr[0:cur]))
+        # Reverse from 0 to mi 
+        arr = arr[mi::-1] + arr[mi+1:len(arr)]
+        # Reverse whole list 
+        arr = arr[cur-1::-1] + arr[cur:len(arr)]
+        cur -= 1
+    return arr
+
+print(pancakesort([0,10,15,3,2,9,14,13]))
diff --git a/sorts/quick_sort_3partition.py b/sorts/quick_sort_3partition.py
new file mode 100644
index 000000000000..def646cdbc50
--- /dev/null
+++ b/sorts/quick_sort_3partition.py
@@ -0,0 +1,31 @@
+from __future__ import print_function
+
+def quick_sort_3partition(sorting, left, right):
+    if right <= left:
+        return
+    a = i = left
+    b = right
+    pivot = sorting[left]
+    while i <= b:
+        if sorting[i] < pivot:
+            sorting[a], sorting[i] = sorting[i], sorting[a]
+            a += 1
+            i += 1
+        elif sorting[i] > pivot:
+            sorting[b], sorting[i] = sorting[i], sorting[b]
+            b -= 1
+        else:
+            i += 1
+    quick_sort_3partition(sorting, left, a - 1)
+    quick_sort_3partition(sorting, b + 1, right)
+
+if __name__ == '__main__':
+    try:
+        raw_input          # Python 2
+    except NameError:
+        raw_input = input  # Python 3
+
+    user_input = raw_input('Enter numbers separated by a comma:\n').strip()
+    unsorted = [ int(item) for item in user_input.split(',') ]
+    quick_sort_3partition(unsorted,0,len(unsorted)-1)
+    print(unsorted)
diff --git a/sorts/tree_sort.py b/sorts/tree_sort.py
new file mode 100644
index 000000000000..94cf68033b55
--- /dev/null
+++ b/sorts/tree_sort.py
@@ -0,0 +1,45 @@
+# Tree_sort algorithm
+# Build a BST and in order traverse.
+
+class node():
+    # BST data structure
+    def __init__(self, val):
+        self.val = val
+        self.left = None 
+        self.right = None 
+    
+    def insert(self,val):
+        if self.val:
+            if val < self.val:
+                if self.left == None:
+                    self.left = node(val)
+                else:
+                    self.left.insert(val)
+            elif val > self.val:
+                if self.right == None:
+                    self.right = node(val)
+                else:
+                    self.right.insert(val)
+        else:
+            self.val = val
+
+def inorder(root, res):
+    # Recursive travesal 
+    if root:
+        inorder(root.left,res)
+        res.append(root.val)
+        inorder(root.right,res)
+
+def treesort(arr):
+    # Build BST
+    if len(arr) == 0:
+        return arr
+    root = node(arr[0])
+    for i in range(1,len(arr)):
+        root.insert(arr[i])
+    # Traverse BST in order. 
+    res = []
+    inorder(root,res)
+    return res
+
+print(treesort([10,1,3,2,9,14,13]))
\ No newline at end of file
diff --git a/strings/min-cost-string-conversion.py b/strings/min-cost-string-conversion.py
new file mode 100644
index 000000000000..7e3298137c05
--- /dev/null
+++ b/strings/min-cost-string-conversion.py
@@ -0,0 +1,123 @@
+from __future__ import print_function
+
+try:
+	xrange		#Python 2
+except NameError:
+	xrange = range	#Python 3
+
+'''
+Algorithm for calculating the most cost-efficient sequence for converting one string into another.
+The only allowed operations are
+---Copy character with cost cC
+---Replace character with cost cR
+---Delete character with cost cD
+---Insert character with cost cI
+'''
+def compute_transform_tables(X, Y, cC, cR, cD, cI):
+	X = list(X)
+	Y = list(Y)
+	m = len(X)
+	n = len(Y)
+
+	costs = [[0 for _ in xrange(n+1)] for _ in xrange(m+1)]
+	ops = [[0 for _ in xrange(n+1)] for _ in xrange(m+1)]
+
+	for i in xrange(1, m+1):
+		costs[i][0] = i*cD
+		ops[i][0] = 'D%c' % X[i-1]
+
+	for i in xrange(1, n+1):
+		costs[0][i] = i*cI
+		ops[0][i] = 'I%c' % Y[i-1]
+
+	for i in xrange(1, m+1):
+		for j in xrange(1, n+1):
+			if X[i-1] == Y[j-1]:
+				costs[i][j] = costs[i-1][j-1] + cC
+				ops[i][j] = 'C%c' % X[i-1]
+			else:
+				costs[i][j] = costs[i-1][j-1] + cR
+				ops[i][j] = 'R%c' % X[i-1] + str(Y[j-1])
+
+			if costs[i-1][j] + cD < costs[i][j]:
+				costs[i][j] = costs[i-1][j] + cD
+				ops[i][j] = 'D%c' % X[i-1]
+
+			if costs[i][j-1] + cI < costs[i][j]:
+				costs[i][j] = costs[i][j-1] + cI
+				ops[i][j] = 'I%c' % Y[j-1]
+
+	return costs, ops
+
+def assemble_transformation(ops, i, j):
+	if i == 0 and j == 0:
+		seq = []
+		return seq
+	else:
+		if ops[i][j][0] == 'C' or ops[i][j][0] == 'R':
+			seq = assemble_transformation(ops, i-1, j-1)
+			seq.append(ops[i][j])
+			return seq
+		elif ops[i][j][0] == 'D':
+			seq = assemble_transformation(ops, i-1, j)
+			seq.append(ops[i][j])
+			return seq
+		else:
+			seq = assemble_transformation(ops, i, j-1)
+			seq.append(ops[i][j])
+			return seq
+
+if __name__ == '__main__':
+	from time import sleep
+	_, operations = compute_transform_tables('Python', 'Algorithms', -1, 1, 2, 2)
+
+	m = len(operations)
+	n = len(operations[0])
+	sequence = assemble_transformation(operations, m-1, n-1)
+	
+	file = open('min_cost.txt', 'w')
+
+	string = list('Python')
+	i = 0
+	cost = 0
+	for op in sequence:
+		print(''.join(string))
+
+		if op[0] == 'C':
+			file.write('%-16s' % 'Copy %c' % op[1])
+			file.write('\t\t\t' + ''.join(string))
+			file.write('\r\n')
+			
+			cost -= 1
+		elif op[0] == 'R':
+			string[i] = op[2]
+
+			file.write('%-16s' % ('Replace %c' % op[1] + ' with ' + str(op[2])))
+			file.write('\t\t' + ''.join(string))
+			file.write('\r\n')
+			
+			cost += 1
+		elif op[0] == 'D':
+			string.pop(i)
+
+			file.write('%-16s' % 'Delete %c' % op[1])
+			file.write('\t\t\t' + ''.join(string))
+			file.write('\r\n')
+			
+			cost += 2
+		else:
+			string.insert(i, op[1])
+
+			file.write('%-16s' % 'Insert %c' % op[1])
+			file.write('\t\t\t' + ''.join(string))
+			file.write('\r\n')
+			
+			cost += 2
+
+		i += 1
+
+	print(''.join(string))
+	print('Cost: ', cost)
+	
+	file.write('\r\nMinimum cost: ' + str(cost))
+	file.close()