Hungry Cows

Each of Farmer John's N (1 <= N <= 50,000) cows has a positive integer
brand that is no larger than 1,000,000,000. He wishes the cows would line
up in numerical order for feeding, but they never cooperate. To encourage
good behavior, he allows a cow to eat only if it is the first cow to be
chosen to eat or if its number is (strictly) greater than the cow that ate
before it.

Given a listing of the ordering of cow brands for the cows standing in
line, what is the largest number of cows that can be fed using FJ rules?

Consider this line of 11 cows:

2 5 18 3 4 7 10 9 11 8 15

One could feed cows in the order 2, 3, 4, 7, 10, 11, and 15 for a total of
seven fed, the largest number possible.

One could not feed cows in the order 2, 5, 3, 10, 15 since cow 3's brand is
not greater than its predecessor, 5.

PROBLEM NAME: hunger

INPUT FORMAT:

* Line 1: A single integer: N.

* Lines 2..?: Each line except potentially the last contains 20
        space-separated integers that are successively the brands of
        the cows in line. The last line might have fewer than 20
        integers if N is not an exact multiple of 20.

SAMPLE INPUT:

11
2 5 18 3 4 7 10 9 11 8 15

OUTPUT FORMAT:

* Line 1: A single integer that is the length of the largest chain of
        cows where each brand is greater than its predecessor.

SAMPLE OUTPUT:

7