Given a sequence, find the length of the largest strictly increasing subsequence.
First line contains the length n (1≤n≤1000) of the sequence. The second line contains the sequence itself. All numbers are integers not exceeding 104 by absolute value.
Print the maximum length of strictly increasing subsequence.