The quartermaster Tarun has been asked to plan the harvest festival. On the desk lies a long table of ingots readings. Task: Read n integers and print the largest absolute difference between two consecutive elements. For n=1 print 0. Input format: First line: n. Second line: n space-separated integers. Output format: Print the maximum consecutive absolute difference. Constraints: 1 <= n <= 36; -1000000 <= a[i] <= 1000000000; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 36; -1000000 <= a[i] <= 1000000000; answers fit a signed 64-bit integer.
