/*

@theme:hdu1257

@writer:pprp

@begin:17:13

@end:17:26

@declare:LIS的裸题,温习一下

@error:注意题目中说明了是多组数据

@date:2017/9/2

*/

#include <bits/stdc++.h>

using namespace std;

const int maxn = ;

int arr[maxn];

int dp[maxn];

int main()

{

    //freopen("in.txt","r",stdin);

    int N,Max = ;

    while(cin >> N)

    {

        Max = ;

        for(int i =  ; i < N; i++)

        {

            dp[i] = ;

            cin >> arr[i];

            for(int j =  ; j < i ; j++)

            {

                if(arr[j] < arr[i])

                {

                    dp[i] = max(dp[j]+,dp[i]);

                }

            }

            Max = max(Max,dp[i]);

        }

        cout << Max << endl;

    }

    return ;

}

/*

@theme:hdu1257

@writer:pprp

@begin:17:13

@end:17:36

@declare:LIS的裸题,温习一下

@error:

@date:2017/9/2

*/

#include <bits/stdc++.h>

using namespace std;

const int maxn = ;

int arr[maxn];

int tmp[maxn];

int main()

{

    //freopen("in.txt","r",stdin);

    int N,len = ;

    while(cin >> N)

    {

        len = ;

        cin >> arr[];

        tmp[len] = arr[];

        for(int i =  ; i < N ; i++)

        {

            cin >> arr[i];

            if(arr[i] > tmp[len])

            {

                len++;

                tmp[len] = arr[i];

            }

            else

                *lower_bound(tmp,tmp+len,arr[i]) = arr[i];

        }

        cout << len << endl;

    }

    return ;

}