LIS O(n^2)

#include<bits/stdc++.h>
using namespace std;

#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define ld long double
#define pb push_back
#define fe first
#define se second
#define nl "\n"
#define pp pair < ll , ll >
#define sz(x) (ll)x.size()
#define st(x) sort(x.begin(),x.end())
#define rst(x) sort(x.rbegin(), x.rend())
#define all(x) x.begin(),x.end()
long double pi = 3.14159265358979323;

const double EPS = 1e-12;
const int N = 1e6 + 5;
const int mod = 1e9 + 7;

//Day1
//Longest Increasing Subsequence in O(n^2)


int main()
{
    fast;
    ll n;
    cin >> n;
    ll arr[n];
    for(int i = 0  ; i < n ;i++ ){
        cin >> arr[i];
    }
    vector < vector < ll > > dp(n);

    for(int i = 0 ; i < n ;i++ ){
        for(int j = 0 ; j < i ; j++ ){
            if(arr[i] > arr[j] && dp[i].size() < dp[j].size() + 1){
                    dp[i] = dp[j];
            }
        }
        dp[i].pb(arr[i]);
    }

    ll maxm = 0 ;
    int ind = 0;
    for(int i = 0 ; i < n ;i++ ){
        if(maxm < (ll)dp[i].size()){
            maxm = (ll)dp[i].size();
            ind = i;
        }
    }
    cout << maxm << "\n";
    for(auto it : dp[ind]){
        cout << it << " ";
    }






















    return 0;

}