/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author
 */

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

#pragma GCC optimize("O2")
//#pragma GCC optimize("unroll-loops")
#define VI vector<int>
#define G(size_1) vector<vector<int>>(size_1, vector<int>())
#define SZ(x) ((int)(x).size())
#define READ ({int t;cin >> t;t;})
#define PII pair<int, int>

#define FOR(i, _begin, _end) for (__typeof(_end) end = _end, begin = _begin,  i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define REP(i, end) for (__typeof(end) i = 0, _len = (end); i < (_len); i += 1)
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define MOD(x, m) ((((x) % (m)) + (m)) % (m))
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define EB emplace_back
#define PB push_back
#define fcout cout << fixed << setprecision(12)
#define fcerr cerr << fixed << setprecision(12)
#define print(x) cout << (x) << '\n';
#define printE(x) cout << (x) << endl;
#define fprint(x) cout << fixed << setprecision(12) << (x) << endl
# define BYE(a) do { cout << (a) << endl; return ; } while (false)

#ifdef DEBUG
#define ERR(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); _err(cerr,_it, args); }
//#define DBG(x) std::cerr << #x << " = " << x << endl;
#else
#define DBG(x) {};
#define ERR(args...) {};
#endif
void _err(std::ostream& cerr,istream_iterator<string> it) {cerr << endl;}
template<typename T, typename... Args>
void _err(std::ostream& cerr, istream_iterator<string> it, T a, Args... args) {
    cerr << *it << " = " << a << "  ";
    _err(cerr,++it, args...);
}

const double pi = 2 * acos(.0);
const int inf = 0x3f3f3f3f;
const ll mod = (ll) (1e9) + 7;

template<class T>bool Chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool Chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

template <typename T>
istream& operator >> (istream& is, vector<T>& V) {
    for(auto&& ele : V)is >> ele;
    return is;
}

template <typename T>
ostream& operator << (ostream& os, const vector<T> V) {
    os << "[";
    int cnt = 0;
    T curr;
    if(!V.empty()){
        for (int i = 0; i < V.size() - 1; ++i) {
            if(V[i] == curr)cnt ++;
            else cnt = 0;
            if(cnt == 4)os << "... ";
            if(cnt < 4)
                os << i << ":" << V[i] << " ";
            curr = V[i];
        }
        os << V.size() - 1 << ":" << V.back();
    }
    os << "]\n";
    return os;
}

template <typename T, typename U>
ostream& operator << (ostream& os, const pair<T,U> P) {
    os << "(";
    os << P.first << "," << P.second;
    os << ")";
    return os;
}

template <typename T, typename U>
ostream& operator << (ostream& os, const set<T,U> V) {
    os << "{";
    if(!V.empty()){
        auto it = V.begin();
        for (int i = 0; i < V.size() -1; ++i) {
            os << *it << " ";
            it++;
        }
        os << *it;
    }
    os << "}\n";
    return os;
}

template <typename K, typename H, typename P>
ostream& operator << (ostream& os, const unordered_set<K, H, P> V) {
    os << "{";
    if(!V.empty()){
        auto it = V.begin();
        for (int i = 0; i < V.size() -1; ++i) {
            os << *it << " ";
            it++;
        }
        os << *it;
    }
    os << "}\n";
    return os;
}

template <typename K, typename C>
ostream& operator << (ostream& os, const multiset<K, C> V) {
    os << "{";
    if(!V.empty()){
        auto it = V.begin();
        for (int i = 0; i < V.size() -1; ++i) {
            os << *it << " ";
            it++;
        }
        os << *it;
    }
    os << "}";
    return os;
}

template <typename K, typename T, typename C>
ostream& operator << (ostream& os, const map<K,T,C> V) {
    os << "{";
    if(!V.empty()){
        auto it = V.begin();
        for (int i = 0; i < V.size() -1; ++i) {
            os << "(";
            os << it->first << "," << it->second;
            os << ") ";
            it++;
        }
        os << "(";
        os << it->first << "," << it->second;
        os << ")";
    }
    os << "}\n";
    return os;
}

template <typename K, typename T, typename C>
ostream& operator << (ostream& os, const unordered_map<K,T,C> V) {
    os << "{";
    if(!V.empty()){
        auto it = V.begin();
        for (int i = 0; i < V.size() -1; ++i) {
            os << "(";
            os << it->first << "," << it->second;
            os << ") ";
            it++;
        }
        os << "(";
        os << it->first << "," << it->second;
        os << ")";
    }
    os << "}\n";
    return os;
}

template <typename T>
ostream& operator << (ostream& os, const deque<T> V) {
    os << "[";
    if (!V.empty()) {
        for (int i = 0; i < V.size() - 1; ++i) {
            os << V[i] << "->";
        }
        if (!V.empty())os << V.back();
    }
    os << "]\n";
    return os;
};

template <typename T, typename Cont, typename Comp>
ostream& operator << (ostream& os, const priority_queue<T, Cont, Comp> V) {
    priority_queue<T, Cont, Comp> _V = V;
    os << "[";
    if(!_V.empty()){
        while(_V.size() > 1){
            os << _V.top() << "->";
            _V.pop();
        }
        os << _V.top();
    }
    os << "]\n";
    return os;
};

template <class F>
struct y_combinator {
    F f; // the lambda will be stored here

    // a forwarding operator():
    template <class... Args>
    decltype(auto) operator()(Args&&... args) const {
        // we pass ourselves to f, then the arguments.
        // the lambda should take the first argument as `auto&& recurse` or similar.
        return f(*this, std::forward<Args>(args)...);
    }
};
// helper function that deduces the type of the lambda:
template <class F>
y_combinator<std::decay_t<F>> recursive(F&& f){
return {std::forward<F>(f)};
}

struct hash_pair {
    template <class T1, class T2>
    size_t operator()(const pair<T1, T2>& p) const
    {
        auto hash1 = hash<T1>{}(p.first);
        auto hash2 = hash<T2>{}(p.second);
        return hash1 ^ hash2;
    }

};

template <typename T, typename U>
std::vector<T> multi_vector(int n, U v) {
    return std::vector<T>(n, v);
}

template <typename U, typename... Args>
auto multi_vector(int n, Args... args) {
    auto val = multi_vector<U>(std::forward<Args>(args)...);
    return std::vector<decltype(val)>(n, std::move(val));
}

template< typename T >
struct Compress {
  vector< T > xs;

  Compress() = default;

  Compress(const vector< T > &vs) {
    add(vs);
  }

  Compress(const initializer_list< vector< T > > &vs) {
    for(auto &p : vs) add(p);
  }

  void add(const vector< T > &vs) {
    copy(begin(vs), end(vs), back_inserter(xs));
  }

  void add(const T &x) {
    xs.emplace_back(x);
  }

  void build() {
    sort(begin(xs), end(xs));
    xs.erase(unique(begin(xs), end(xs)), end(xs));
  }

  vector< int > get(const vector< T > &vs) const {
    vector< int > ret;
    transform(begin(vs), end(vs), back_inserter(ret), [&](const T &x) {
      return lower_bound(begin(xs), end(xs), x) - begin(xs);
    });
    return ret;
  }

  int get(const T &x) const {
    return lower_bound(begin(xs), end(xs), x) - begin(xs);
  }

  const T &operator[](int k) const {
    return xs[k];
  }
};
//#define DBG(x) std::cerr << #x << " = " << x << endl;
//#define FILEIO
//#define int ll
#define MAX(a,b) (a > b ? a : b)
struct tree {
    struct tree *l;
    int v;
    struct tree *r;
    int h;
};

typedef struct tree tree_t;

int count;

int tree_height(tree_t *t){
    if(t == NULL)return -1;
    return t->h;
}


/*
  2分探索木 l の要素は必ず v より小さい
  2分探索木 r の要素は必ず v より大きい
*/
tree_t *tree_create(tree_t *l, int v, tree_t *r){
    tree_t *t = (tree_t*)malloc(sizeof(tree_t));
    t->l = l;
    t->r = r;
    t->v = v;
    t->h = MAX(tree_height(l), tree_height(r)) + 1;
//    count++;
    return t;
}

void tree_free(tree_t *t){
    if(t != NULL){
        free(t);
//        count--;
    }
}


int tree_size(tree_t *t){
    if(t == NULL)return 0;
    return tree_size(t->l) + tree_size(t->r) + 1;
}

void tree_print_elements(tree_t *t){
    if(t == NULL)return;
    tree_print_elements(t->l);
    printf("%d ", t->v);
    tree_print_elements(t->r);
}

/*
  tree_height(l) <= tree_height(r) + 2 &&
  tree_height(r) <= tree_height(l) + 2
  が true であると仮定してよい
*/
/*
発展的課題
tree_t *tree_bal(tree_t *l, int v, tree_t *r) {
}
*/


int tree_mem(int x, tree_t *t){
    if(t == NULL)return 0;
    if(x == t->v)return 1;
    return tree_mem(x, (x < t->v ? t->l : t->r));
}

tree_t *tree_add(int x, tree_t *t) {
    if(t == NULL)return tree_create(NULL, x, NULL);
    if(t->v == x)return t;
    // new tree pointer
    tree *n_t;
    if(x < t->v)n_t = tree_create(tree_add(x, t->l), t->v, t->r);
    else n_t = tree_create(t->l, t->v, tree_add(x, t->r));
    // t won't be used any longer
    free(t);
    return n_t;
}

int tree_min(tree_t *t){
    assert(t != NULL);
    if(t->l == NULL)return t->v;
    return tree_min(t->l);
}

int tree_max(tree_t *t){
    assert(t != NULL);
    if(t->r == NULL)return t->v;
    return tree_max(t->r);
}

tree_t *tree_remove_min(tree_t *t){
    assert(t != NULL);
    tree* n_t;
    if(t->l == NULL)n_t = t->r;
    else n_t = tree_create(tree_remove_min(t->l), t->v, t->r);
    free(t);
    return n_t;
}

tree_t *tree_remove_max(tree_t *t){
    assert(t != NULL);
    tree* n_t;
    if(t->r == NULL)n_t = t->l;
    else n_t = tree_create(t->l, t->v, tree_remove_max(t->r));
    free(t);
    return n_t;
}
/*
  2分探索木 t1 の要素は必ず2分探索木 t2 の要素より小さい
*/
tree_t *tree_merge(tree_t *t1, tree_t *t2){
    if(t2 == NULL)return t1;
    int n_root = tree_min(t2);
    tree *n_t = tree_create(t1, n_root, tree_remove_min(t2));
    return n_t;
}

tree_t *tree_remove(int x, tree_t *t){
    if(t == NULL)return NULL;
    tree_t *n_t;
    if(x == t->v)n_t = tree_merge(t->l, t->r);
    else if(x < t->v)n_t = tree_create(tree_remove(x,t->l), t->v, t->r);
    else n_t = tree_create(t->l, t->v, tree_remove(x, t->r));
    free(t);
    return n_t;
}


class __test {
public:

void solve(std::istream& cin, std::ostream& cout, std::ostream& cerr) {
//    vector<int> w[101010];
//    tree_t* t = NULL;
//    int n,m;
//    cin >> n >> m;
//    REP(i,n){
//        int a,b;
//        cin >> a >> b;
//        w[a].EB(b);
//    }
//    int ans = 0;
//    const int mx = 1e5+5;
//    FOR(i,1,m+1){
//        for(auto b : w[i])t = tree_add(b*mx + i, t);
//        if(t != NULL){ll a = tree_max(t); ans += a/mx;t = tree_remove(a,t);}
////        tree_print_elements(t);
//    }
////    tree_print_elements(t);
//    print(ans);

    int N;cin >> N;
    tree_t *t = NULL;
    REP(i,N){int x;cin >> x;t=tree_add(x, t);}
    print(tree_size(t));

}


};


#undef int
int main() {

	__test solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
    std::ostringstream err;
	in.tie(0); ios::sync_with_stdio(0);
    solver.solve(in, out,err);
	return 0;
}


Measured memory_bytes: 3544