#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;


int lengthOfLIS(vector<int>& seq) {
  if (!seq.size()) return 0;
  vector<int> old = seq;

  sort(seq.begin(), seq.end());

  int longest = 1;

  for (int i = 1; i < seq.size(); ++i) {
    if (seq[i] > seq[i-1] && find(old.begin(), old.end(), seq[i]) - old.begin() > find(old.begin(), old.end(), seq[i-1]) - old.begin()) longest++;
  }
  return longest;
}

/* Driver program to test above function */
int main() {
	vector<int> v = {1,3,6,7,9,4,10,5,6};
	cout << lengthOfLIS(v) << endl;
	return 0;
}