#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define fi first
#define se second
#define inf (INT_MAX/2-1)
#define infl (1LL<<60)
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define sz(a) (int)(a).size()
#define all(a) begin(a),end(a)
#define y0 y5656
#define y1 y7878
#define aaa system("pause");
#define dbg(x) cerr<<(#x)<<": "<<(x)<<'\n',aaa
#define dbga(x,n) cerr<<(#x)<<"[]: ";for(int _=0;_<n;_++)cerr<<x[_]<<' ';cerr<<'\n',aaa
#define dbgs(x) cerr<<(#x)<<"[stl]: ";for(int _:x)cerr<<_<<' ';cerr<<'\n',aaa
#define dbgp(x) cerr<<(#x)<<": "<<x.fi<<' '<<x.se<<'\n',aaa
#define maxn 100000

using namespace std;

ifstream fin ("scmax.in");
ofstream fout ("scmax.out");

int n;

void umax (int &a, int b) { a = max(a,b); }

struct AIB {
  AIB () {}
  int yy[maxn+5];
  int lsb (int x) { return x&(-x); }
  void upd (int x, int amt) {
    for (; x <= n; x += lsb(x)) umax(yy[x], amt);
  }
  int qry (int x) {
    int ans = 0;
    for (; x >= 1; x -= lsb(x)) umax(ans, yy[x]);
    return ans;
  }
};

AIB aib;
int v[maxn+5], best[maxn+5];
map<int,int> normal;

int main () {
  fin >> n;
  int i, j, z;
  for (i = 1; i <= n; i++) {
    fin >> v[i];
    normal[v[i]];
  }
  z = 1;
  for (auto &cur: normal) cur.se = z++;
  for (i = 1; i <= n; i++) v[i] = normal[v[i]];
  for (i = 1; i <= n; i++) {
    best[i] = 1+aib.qry(v[i]-1);
    aib.upd(v[i], best[i]);
  }
  int ans = (*max_element(all(best)));
  fout << ans << '\n';
  for (i = 0; i < ans; i++) fout << 0 << ' ';
  fin.close(); fout.close();
  return 0;
}