Enter a non-empty array in which you wish to find the longest increasing subsequence, in between the square brackets below with numbers separated by commas.