Meticulous smoothing

아직 제출이 없습니다시간 제한1초메모리 제한1024 MB

문제

The arts and crafts teacher is looking at the beautiful plank you crafted in the woodshop, and gaze at you with a stern look. "This is not smooth enough! Use more sandpaper!"

Your plank is nn cm long, and the arts and crafts teacher has measured the width of your plank on kk different locations to prove his point. He demands that the thickness should differ by no more than 11 micrometer between any two consecutive measured location. If the sandpaper will shave off 11 micrometer of wood each time you use it at a particular location, how many times do you need to use the sandpaper?

입력

The first line of input contains a single integer 1n1061 \leq n \leq 10^6, the length of your plank. On the second line of input follows nn space-separated integers k_1,k_2,,k_nk\_1, k\_2, \ldots, k\_n, the thickness of your plank (1k_i1061 \leq k\_i \leq 10^6 for every ii).

출력

Output a single integer, the minimum number of times you need to use the sandpaper (assuming that the sandpaper only touch one location at the same time).