Grid Multiplication

Giver a sequence of grids with dimensions specified in an array art of size N $($where N represents the number of grids plus one$),$ the task is to determine the most efficient approach to multiply these grids. Efficiency, in this context, refers to minimizing the total number of multiplications required.

Note The dimension of the ith Matrix is arr$[$i$-1]$ x : arr$[$i$]$

Input Format

The first line contains an integer N$,$ representing the number of grids

The second line contains N space separated Integers, representing the dimensions of the grids

code in c$++$