SAVE FOR LATER

#include <bits/stdc++.h>
#include <vector>
#include <string>
#include <deque>
#include <iosream>
#include <algorimth>
#include <cmath>

int main(){
int n;
vector<int> S(n);
for(int i = 0; i < n; i++){
	int a;
	cin >> a;
	S.push_back(a);
}

vector<int> dp1(n);
for(int i = 0; i < n; i++){
	dp1[i] = 1;
}

for(int i = 1; i < n; i++){
	if(a[i] > a[i-1]){
		dp[i] += 1;
}

//in ra day con lien tiep tang dan dai nhat

cout << *max_element(dp1.begin(), dp1.end());