Contest 1 - Detecting a sequence (minimum length 5) with one entry wrong

To allow contest participants to test a function which accepts an array of integers (and the number of elements) and detect the one wrong number of potentially longest sequence where every term = sum of previous 2 terms. Each identified sequence will have exactly one number incorrect. Minimum length of the sequence should be 5.

Inputs : I.1) Number of elements in array
              I.2) Array of integers containing possible sequences

Outputs: O.1) Total Number of odd man out sequences found
                O.2) Array of integers storing start and stop of sequences

Note : Longest sequences to be found
         No sequence should be subset of another
         Minimum length of the sequence should be 5