// Prototype of dynamic programming for Longest Strictly Increasing Subsequence
// Based on D. Gries, The Science of Programming, p. 262
// which is based on M. Fredman, Discrete Mathematics 11 (1975),
//   29-35.
// See CSE 2320 Notes 07

import java.util.Scanner;

public class LSIS
{
  public static void main(String[] args)
  {
    // Get input sequence
    Scanner sc=new Scanner(System.in);
    int n=sc.nextInt();
    int y[]=new int[n+1];
    for (int i=1;i<y.length;i++)
      y[i]=sc.nextInt();

    // Initialize table for binary search for DP
    Integer bsTabC[]=new Integer[y.length];
    int bsTabI[]=new int[y.length];
    bsTabC[0]=(-999999);  // Must be smaller than all input values.
    bsTabI[0]=0;          // Index of predecessor (0=grounded)
    for (int i=1;i<y.length;i++)
      bsTabC[i]=999999;   // Must be larger than all input values.

    int C[]=new int[y.length];
    C[0]=0;  // DP base case

    int j[]=new int[y.length];
    j[0]=0;

    for (int i=1;i<y.length;i++) {
      // Find SIS that y[i] could be appended to.
      // See CSE 2320 Notes 01 for binSearchLast()
      int k=BinarySearch.binSearchLast(bsTabC,y[i]);
      // y[i] only matters if it is not already in table.
      if (bsTabC[k]<y[i]) {
        C[i]=k+1;         // Save length of LIS for y[i]
        j[i]=bsTabI[k];   // Predecessor of y[i]
        bsTabC[k+1]=y[i]; // Decrease value for this length IS
        bsTabI[k+1]=i;
      }
      else
      {
        C[i]=(-1);        // Mark as ignored
        j[i]=(-1);
      }
    }

    System.out.print("  i   y   C   j\n");
    System.out.print("---------------\n");
    for (int i=1;i<y.length;i++)
      System.out.format("%3d %3d %3d %3d\n",i,y[i],C[i],j[i]);
   
    int LSISlength;
    for (LSISlength=y.length-1;
         (Integer) bsTabC[LSISlength]==999999;
         LSISlength--)
      ;
    System.out.print("  i bsTabC bsTabI\n");
    System.out.print("-----------------\n");
    for (int i=1;i<= LSISlength;i++)
      System.out.format("%3d %6d %6d\n",i,bsTabC[i],bsTabI[i]);
    System.out.print("Length of LSIS is "+ LSISlength +"\n");
    System.out.print("LSIS reversed\n");
    for (int i=bsTabI[LSISlength];
         i>0;
         i=j[i])
      System.out.print(y[i]+"\n");
}
}