Cow Queues 

(subseq.X)

A number of Farmer Keller's cows (each labeled 'A'..'Z', though
not necessarily uniquely) lines up to feed twice a day. 
Not all cows eat twice a day, but some do.
A queue line is described as an ordered sequence of 1..80
characters that are the cow labels, starting with the first cow in
line.

Given the morning and afternoon sequence, determine the length of
the largest (sub)set of cow labels that is in the same order in the
morning feeding and afternoon feeding. This set of cows in the same
order is, most likely, NOT going to be contiguous.

PROBLEM NAME: subseq.X

INPUT FORMAT:

* Lines 1..2: One list of cow labels per line. Each list has some
        length 1..80 and contains only capital letters.

SAMPLE INPUT:

THEQUICKBROWNCOW
JUMPEDOVERADOG

OUTPUT FORMAT:

* Line 1: One integer, the length of the longest (potentially
        non-contiguous) common subsequence.

SAMPLE OUTPUT:

3

OUTPUT DETAILS:

The longest common subsequence is "EOO".