#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void move_inside(int i);
void move_outside(int i);
int press_button();
const int NN = 2100;
bool inside[NN];
int min_cardinality(int N) {
vector<int> ord;
for (int i = 0; i < N; i++)
ord.push_back(i);
for (int i = 0; i < N; i++)
inside[i] = false;
int cnt = 0;
vector<int> cur;
random_shuffle(begin(ord), end(ord));
for (int i : ord) {
move_inside(i);
cnt++;
inside[i] = true;
cur.push_back(i);
int ans = press_button();
if (ans > 1) {
move_outside(i);
cnt--;
inside[i] = false;
cur.pop_back();
}
}
int tt = cnt;
int l = 1, r = N / cnt;
while (l < r) {
int mid = (l + r) / 2 + 1;
int old = tt;
random_shuffle(begin(ord), end(ord));
for (int i : ord) {
if (tt == cnt * mid) break;
if (inside[i]) continue;
move_inside(i);
tt++;
inside[i] = true;
cur.push_back(i);
int ans = press_button();
if (ans > mid) {
move_outside(i);
tt--;
inside[i] = false;
cur.pop_back();
}
}
if (tt == cnt * mid) {
l = mid;
} else {
r = tt / cnt;
while (tt != old) {
int x = cur.back();
move_outside(x);
tt--;
inside[x] = false;
cur.pop_back();
}
}
}
return l;
}
/*
static inline constexpr int kMaxQueries = 40000;
static int N;
// Insect types are compressed to colors in the range [0, N).
static std::vector<int> color;
static std::vector<bool> in_box;
static std::vector<int> color_occurrences;
static std::multiset<int> max_occurrences;
static std::vector<int> op_counter(3, 0);
static inline void protocol_violation(std::string message) {
printf("Protocol Violation: %s\n", message.c_str());
exit(0);
}
void move_inside(int i) {
if (i < 0 || i >= N) {
protocol_violation("invalid parameter");
}
++op_counter[0];
if (op_counter[0] > kMaxQueries) {
protocol_violation("too many calls");
}
if (!in_box[i]) {
in_box[i] = true;
max_occurrences.erase(max_occurrences.find(color_occurrences[color[i]]));
++color_occurrences[color[i]];
max_occurrences.insert(color_occurrences[color[i]]);
}
}
void move_outside(int i) {
if (i < 0 || i >= N) {
protocol_violation("invalid parameter");
}
++op_counter[1];
if (op_counter[1] > kMaxQueries) {
protocol_violation("too many calls");
}
if (in_box[i]) {
in_box[i] = false;
max_occurrences.erase(max_occurrences.find(color_occurrences[color[i]]));
--color_occurrences[color[i]];
max_occurrences.insert(color_occurrences[color[i]]);
}
}
int press_button() {
++op_counter[2];
if (op_counter[2] > kMaxQueries) {
protocol_violation("too many calls");
}
return *(max_occurrences.rbegin());
}
int main() {
assert(1 == scanf("%d", &N));
color.resize(N);
in_box.assign(N, false);
std::map<int, int> type_to_color;
for (int i = 0; i < N; ++i) {
int Ti;
assert(1 == scanf("%d", &Ti));
if (type_to_color.find(Ti) == type_to_color.end()) {
int new_color = type_to_color.size();
type_to_color[Ti] = new_color;
max_occurrences.insert(0);
}
color[i] = type_to_color[Ti];
}
color_occurrences.assign(type_to_color.size(), 0);
int answer = min_cardinality(N);
int Q = *std::max_element(op_counter.begin(), op_counter.end());
printf("%d\n", answer);
printf("%d\n", Q);
return 0;
}
//*/
