Find number of unique longest increasing subsequence in array a.
Constraints : 1 <= Lenght of a <= 5000, 0 < a[i] < 2^31
Example input :
4
1 2 2 3
Example output :
1
Help me :v.