Educational Codeforces Round 15 |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

dp

greedy

implementation

*800

No tag edit access

The problem statement has recently been changed. View the changes.

×
A. Maximum Increase

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou are given array consisting of *n* integers. Your task is to find the maximum length of an increasing subarray of the given array.

A subarray is the sequence of consecutive elements of the array. Subarray is called increasing if each element of this subarray strictly greater than previous.

Input

The first line contains single positive integer *n* (1 ≤ *n* ≤ 10^{5}) — the number of integers.

The second line contains *n* positive integers *a*_{1}, *a*_{2}, ..., *a*_{n} (1 ≤ *a*_{i} ≤ 10^{9}).

Output

Print the maximum length of an increasing subarray of the given array.

Examples

Input

5

1 7 2 11 15

Output

3

Input

6

100 100 100 100 100 100

Output

1

Input

3

1 2 3

Output

3

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/30/2023 11:30:47 (j1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|