# The Calculus of Ada

While mostly known for the programs she wrote for Charles Babbage’s Analytic Engine, Augusta Ada King-Noel, Countess of Lovelace, described how the method of finite differences could be used to solve all types of problems involving number sequences and series. These techniques were implemented in Babbage’s Difference Engine.

The algorithm: If we compute the difference between consecutive values in a numeric sequence, we will obtain a new sequence which is related to the derivative of the function implied by the original sequence. For sequences generated from first-order polynomials (linear functions) the successive differences will be a list of identical values, (i.e., a constant difference). For second-order polynomial functions the lists of differences will be a new sequence whose values change linearly. In turn, the list of differences of the values in this generated list (i.e., the finite differences of the list of differences) will be constant, and so on for higher-order polynomials. In general the $n^{\text {th}}$ row of differences will be constant for an $n^{\text {th}}$ degree polynomial.

For example, the first-order polynomial $3x + 3$ produces the sequence below at $x=0,1,2,3,4$, and the first differences are shown on the following line.

3 6 9 12 15 3 3 3 3

As another example, the polynomial $x^2$, if evaluated at inputs $x=3, 5, 7, 9,$ produces the sequence below.

9 25 49 81 16 24 32 8 8

Furthermore, if we consider a minimum-order polynomial that produces the original sequence, its value at the next regularly spaced input can be predicted by extending the difference table.

## Input

The input consists of a value $n$, designating the number of polynomial evaluations given with $2 \leq n \leq 10$, follwed by $n$ values $v_1, v_2, \ldots , v_{n}$ which represent the value of a polynomial when evaluated at $n$ regularly spaced input values. Each $v_ j$ will satisfy $-2\, 000\, 000 \leq v_ j \leq 2\, 000\, 000$ and at least two of those values will differ from each other.

## Output

Output two integer values $d$ and $v_{n+1}$, separated by a space. The value $d$ must be the degree of a minimal-degree polynomial producing the original sequence, and $v_{n+1}$ must be the value of the polynomial if evaluated at the next regularly spaced input value.

Sample Input 1 | Sample Output 1 |
---|---|

5 3 6 9 12 15 |
1 18 |

Sample Input 2 | Sample Output 2 |
---|---|

4 9 25 49 81 |
2 121 |

Sample Input 3 | Sample Output 3 |
---|---|

6 39 6 -3 0 3 -6 |
3 -39 |