import java.util.Arrays;
import java.util.Scanner;


public class Main {

    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int n = s.nextInt();
        int[] a = new int[n];
        int[] b = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = b[n - i - 1] = s.nextInt();
        }
        int[] result1 = LongestIncreasingSubsequence(a, n);
        int[] result2 = LongestIncreasingSubsequence(b, n);
        if (result2.length >= result1.length) {
            System.out.println(result2.length);
            for (int i : result2)
                System.out.print(i + " ");
        } else {
            System.out.println(result1.length);
            for (int i = result1.length - 1; i >= 0; i--)
                System.out.print(result1[i] + " ");
        }
    }

    static int GetCeilIndex(int arr[], int T[], int l, int r, int key) {

        while (r - l > 1) {
            int m = l + (r - l) / 2;
            if (arr[T[m]] >= key)
                r = m;
            else
                l = m;
        }
        return r;
    }

    static int[] LongestIncreasingSubsequence(
            int arr[], int n) {


        int tailIndices[] = new int[n];


        Arrays.fill(tailIndices, 0);

        int prevIndices[] = new int[n];


        Arrays.fill(prevIndices, -1);

        int len = 1;

        for (int i = 1; i < n; i++) {
            if (arr[i] < arr[tailIndices[0]])

                tailIndices[0] = i;

            else if (arr[i] >
                    arr[tailIndices[len - 1]]) {

                prevIndices[i] = tailIndices[len - 1];
                tailIndices[len++] = i;
            } else {

                int pos = GetCeilIndex(arr,
                        tailIndices, -1, len - 1, arr[i]);

                prevIndices[i] = tailIndices[pos - 1];
                tailIndices[pos] = i;
            }
        }


        int[] res = new int[len];
        int j = 0;
        for (int i = tailIndices[len - 1]; i >= 0 && j < len; i = prevIndices[i])
            res[j++] = arr[i];

        return res;
    }
}


100
119 345 249 442 461 302 186 9 71 122 368 119 264 184 368 59 256 17 498 138 46 23 101 105 426 484 315 375 269 146 57 75 359 38 211 84 135 186 438 146 457 243 362 406 44 195 134 221 115 459 477 58 158 80 86 360 9 127 68 145 88 75 460 220 383 134 146 324 224 202 42 450 111 61 459 489 273 403 136 52 364 44 75 87 13 390 354 234 63 103 76 163 60 302 128 394 314 2 108 197