The following languages are only available languages for the problems from the contest

VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror):

- J

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

D. Maximal Difference

time limit per test

2 secondsmemory limit per test

64 megabytesinput

standard inputoutput

standard outputYou are given an array of integers *a*_{i}. Find the largest absolute value of difference between adjacent elements of the array *max*(*abs*(*a*_{i} - *a*_{i + 1})).

Input

The only line of the input contains a list of space-separated integers *a*_{i} (1 ≤ *a*_{i} ≤ 100) — elements of the array. The size of the array is between 2 and 10, inclusive. Note that the size of the array is not given explicitly!

Output

Output a single integer — the largest absolute value of difference between adjacent elements of the array.

Examples

Input

2 10 4 8 6 12

Output

8

Input

3 3

Output

0

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/24/2017 14:48:29 (c2).

Desktop version, switch to mobile version.
User lists

Name |
---|