Complete this java program

Using dp to finish this.
Input: an int n
Output: the fewest number of 1's in an expression involving only +,*,1,(, and ) which is equal to n, or -1 if no such expression is possible