diff --git a/MatrixChainMultiplication.py b/MatrixChainMultiplication.py
new file mode 100644
index 0000000..26ce1ca
--- /dev/null
+++ b/MatrixChainMultiplication.py
@@ -0,0 +1,29 @@
+import sys
+
+def MatrixChainOrder(p, n):
+	m = [[0 for x in range(n)] for x in range(n)]
+
+	for i in range(1, n):
+		m[i][i] = 0
+
+	# L is chain length.
+	for L in range(2, n):
+		for i in range(1, n-L + 1):
+			j = i + L-1
+			m[i][j] = sys.maxsize
+			for k in range(i, j):
+
+				# q = cost / scalar multiplications
+				q = m[i][k] + m[k + 1][j] + p[i-1]*p[k]*p[j]
+				if q < m[i][j]:
+					m[i][j] = q
+
+	return m[1][n-1]
+
+# Driver program to test above function
+arr = [1, 2, 3, 4, 3]
+size = len(arr)
+
+print("Minimum number of multiplications is " +
+	str(MatrixChainOrder(arr, size)))
+# This Code is contributed by Bhavya Jain