#include <algorithm>
#include <cmath>
#include <vector>
#include <iostream>
#include <random>

using namespace std;


#define MATRIX_SIZE 1000

void printPath() {

}

int check(int i, int j, vector<vector<int> > matrix, vector<vector<int> > length) {
    if (length[i][j] == -1) {
        int currentValue = matrix[i][j];

        int len = 0;
        if ((i > 0) && (matrix[i-1][j] > currentValue)) { // check up
            len = max(len, check(i-1, j, matrix, length));
        }
        if ((i + 1 < matrix.size()) && (matrix[i+1][j] > currentValue)) { // check left
            len = max(len, check(i+1, j, matrix, length));
        }
        if ((j > 0) && (matrix[i][j-1] > currentValue)) { // check down
            len = max(len, check(i, j-1, matrix, length));
        }
        if ((j+1 < matrix[i].size()) && (matrix[i][j+1] > currentValue)) { // check right
            len = max(len, check(i, j+1, matrix, length));
        }
        length[i][j] = len + 1; // Include current cell
    }
    return length[i][j];
}

int longestPath(vector<vector<int> > matrix) {
    int n = matrix[0].size();
    int m = matrix.size();
    vector<vector<int> > length(m, vector<int>(n,-1));

    int len = 0;
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++) {
            len = max(len, check(i, j, matrix, length));
        }
    }
    return len;
}


int main() {
    // Specify the number of rows and columns of the matrix
    int n = MATRIX_SIZE;
    int m = MATRIX_SIZE;

    // Declare random number generator
    mt19937 gen(10);
    uniform_int_distribution<> dis(1, 1000000);

    // Fill matrix
    vector<vector<int> > matrix;
    for(int i = 0; i < m; i++) {
            vector<int> row;
        for(int j = 0; j < n; j++) {
            row.push_back(0);
        }
        matrix.push_back(row);
    }

    // Apply random number generator to create matrix
    for(int i = 0; i < m; i++) {
        for(int j = 0; j < n; j++) {
            matrix[i][j] = dis(gen);
        }
    }

    // Print matrix to see contents
//  for(int i = 0; i < m; i++) {
//      for(int j = 0; j < n; j++) {
//          cout << matrix[i][j] << " ";
//      }
//      cout << endl;
//  }
//  cout << endl;

    int result = longestPath(matrix);
    cout << result << endl;





}