35pts求调玄关

%:include <bits/stdc++.h>
using namespace std;
signed k, t, s;
vector<signed> vec;
int LIS(const vector<signed>& nums) {
	if (nums.empty()) return 0;
	vector<int> dp(nums.size(), 1);
	for (int i = 1; i < nums.size(); ++i) {
		for (int j = 0; j < i; ++j) {
			if (nums[j] <= nums[i]) {
				dp[i] = max(dp[i], dp[j] + 1);
			}
		}
	}
	return *max_element(dp.begin(), dp.end());
}
signed main(){
	cin>>k;
	for(signed i=0; i<k; i++){
		cin>>t;
		vec.emplace_back(t);
	}
	sort(vec.begin(), vec.end());
	auto last = unique(vec.begin(), vec.end());
	vec.erase(last, vec.end());
	cout<<LIS(vec);
	return 0;
}