#include <iostream>
#include <vector>
using namespace std;
int n;
vector<int> arr;
int findlong(int index) {
int max = 0;
int count = 1;
for (int j = index + 1; j < arr.size(); j++) {
int pre = arr[index];
for (int i = j; i < arr.size(); i++) {
if (arr[i] > pre) {
count++;
pre = arr[i];
}
}
if (count > max) {
max = count;
}
count = 1;
}
return max;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int k;
cin >> k;
arr.push_back(k);
}
int max = 0;
for (int i = 0; i < n; i++) {
if (max <= findlong(i)) {
max = findlong(i);
}
}
if (n == 1) {
cout << 1 << endl;
}
else {
cout << max << endl;
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBuOwp2ZWN0b3I8aW50PiBhcnI7CgppbnQgZmluZGxvbmcoaW50IGluZGV4KSB7CiAgICBpbnQgbWF4ID0gMDsKICAgIGludCBjb3VudCA9IDE7CiAgICBmb3IgKGludCBqID0gaW5kZXggKyAxOyBqIDwgYXJyLnNpemUoKTsgaisrKSB7CiAgICAgICAgaW50IHByZSA9IGFycltpbmRleF07CiAgICAgICAgZm9yIChpbnQgaSA9IGo7IGkgPCBhcnIuc2l6ZSgpOyBpKyspIHsKICAgICAgICAgICAgaWYgKGFycltpXSA+IHByZSkgewogICAgICAgICAgICAgICAgY291bnQrKzsKICAgICAgICAgICAgICAgIHByZSA9IGFycltpXTsKICAgICAgICAgICAgfQogICAgICAgIH0KICAgICAgICBpZiAoY291bnQgPiBtYXgpIHsKICAgICAgICAgICAgbWF4ID0gY291bnQ7CiAgICAgICAgfQogICAgICAgIGNvdW50ID0gMTsKICAgIH0KICAgIHJldHVybiBtYXg7Cn0KCmludCBtYWluKCkgewogICAgY2luID4+IG47CiAgICBmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykgewogICAgICAgIGludCBrOwogICAgICAgIGNpbiA+PiBrOwogICAgICAgIGFyci5wdXNoX2JhY2soayk7CiAgICB9CiAgICBpbnQgbWF4ID0gMDsKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKSB7CiAgICAgICAgaWYgKG1heCA8PSBmaW5kbG9uZyhpKSkgewogICAgICAgICAgICBtYXggPSBmaW5kbG9uZyhpKTsKICAgICAgICB9CiAgICB9CiAgICBpZiAobiA9PSAxKSB7CiAgICAgICAgY291dCA8PCAxIDw8IGVuZGw7CiAgICB9CiAgICBlbHNlIHsKICAgICAgICBjb3V0IDw8IG1heCA8PCBlbmRsOwogICAgfQoKICAgIHJldHVybiAwOwp9Cg==