function solve(input) {
    //given arr consisting of N integers
    //find number of non-decreasing consecutive sequences in arr

    var N = input[0];
    var arr = [];
    for (var i = 0; i < N; i++) {
        arr[i] = Number(input[i + 1]);
    }

    var count = 1;

    for (var j = 0; j < arr.length - 1; j++) {
        var currentNum = arr[j];
        var nextNum = arr[j + 1];

        if(currentNum <= nextNum) {
            var k = j + 1;
            if((k == arr.length - 1)&&(arr[j]<=arr[j+1])) {
                break;
            } else if((k == arr.length - 1)&&(arr[j]>arr[j+1])) {
                count++;
                break;
            } else {
                while(k < arr.length - 1) {
                    if(arr[k] > arr[k+1]){
                        count++;
                        j = k;
                        break;
                    }
                    k++;
                }

            }

        } else {
            count++;
        }

    }

    console.log(count);
}