Kata

Lines consisting of characters indicating uppercase letters of the Latin alphabet will be added to the input.

Determine the maximum number of consecutive characters, among which no two letters from the set of letters N, O and P (taking into account repetitions) are written in a row. Spaces should not be taken into account.(ignore spaces altogether)

To perform this task, you should write a function.

Example:

For the AAANAPOAA string, the answer will be 6. 
'PO' divides our line into two lines and the maximum length will be at the first line.

If the line is empty, return 0.

If the string contains a number, return -1.

Good luck!