﻿using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;


//Problem 5. Maximal increasing sequence

//Write a program that finds the maximal increasing sequence in an array.


class MaximalIncreasingSequence
{
    static void Main()
    {

        char[] separators = new char[] { ' ', '\t', ',', '.' };
        string[] userInput = Console.ReadLine().Split(separators, StringSplitOptions.RemoveEmptyEntries);
        int[] array = Array.ConvertAll(userInput, int.Parse);
        int longestSequence = 0;
        int currenSequence = 0;
        int longestDigit = 0;
        int currentDigit = array[0];


        for (int i = 0; i < array.Length; i++)
        {
            if (array[i] > currentDigit)
            {

                ++currenSequence;
                if (currenSequence > longestSequence)
                {
                    longestSequence = currenSequence;
                    longestDigit = currentDigit;
                }
                currentDigit = array[i];
            }
            else
            {
                currentDigit = array[i];
                currenSequence = 1;
            }
        }

    
        Console.WriteLine("The longest increasing sequence is of {0} numbers.", longestSequence);





    }
}

