Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official.
×

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only 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

The problem statement has recently been changed. View the changes.

×
B. Mike and Shortcuts

time limit per test

3 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputRecently, Mike was very busy with studying for exams and contests. Now he is going to chill a bit by doing some sight seeing in the city.

City consists of *n* intersections numbered from 1 to *n*. Mike starts walking from his house located at the intersection number 1 and goes along some sequence of intersections. Walking from intersection number *i* to intersection *j* requires |*i* - *j*| units of energy. The total energy spent by Mike to visit a sequence of intersections *p*_{1} = 1, *p*_{2}, ..., *p*_{k} is equal to units of energy.

Of course, walking would be boring if there were no shortcuts. A shortcut is a special path that allows Mike walking from one intersection to another requiring only 1 unit of energy. There are exactly *n* shortcuts in Mike's city, the *i*^{th} of them allows walking from intersection *i* to intersection *a*_{i} (*i* ≤ *a*_{i} ≤ *a*_{i + 1}) (but not in the opposite direction), thus there is exactly one shortcut starting at each intersection. Formally, if Mike chooses a sequence *p*_{1} = 1, *p*_{2}, ..., *p*_{k} then for each 1 ≤ *i* < *k* satisfying *p*_{i + 1} = *a*_{pi} and *a*_{pi} ≠ *p*_{i} Mike will spend only 1 unit of energy instead of |*p*_{i} - *p*_{i + 1}| walking from the intersection *p*_{i} to intersection *p*_{i + 1}. For example, if Mike chooses a sequence *p*_{1} = 1, *p*_{2} = *a*_{p1}, *p*_{3} = *a*_{p2}, ..., *p*_{k} = *a*_{pk - 1}, he spends exactly *k* - 1 units of total energy walking around them.

Before going on his adventure, Mike asks you to find the minimum amount of energy required to reach each of the intersections from his home. Formally, for each 1 ≤ *i* ≤ *n* Mike is interested in finding minimum possible total energy of some sequence *p*_{1} = 1, *p*_{2}, ..., *p*_{k} = *i*.

Input

The first line contains an integer *n* (1 ≤ *n* ≤ 200 000) — the number of Mike's city intersection.

The second line contains *n* integers *a*_{1}, *a*_{2}, ..., *a*_{n} (*i* ≤ *a*_{i} ≤ *n* , , describing shortcuts of Mike's city, allowing to walk from intersection *i* to intersection *a*_{i} using only 1 unit of energy. Please note that the shortcuts don't allow walking in opposite directions (from *a*_{i} to *i*).

Output

In the only line print *n* integers *m*_{1}, *m*_{2}, ..., *m*_{n}, where *m*_{i} denotes the least amount of total energy required to walk from intersection 1 to intersection *i*.

Examples

Input

3

2 2 3

Output

0 1 2

Input

5

1 2 3 4 5

Output

0 1 2 3 4

Input

7

4 4 4 4 7 7 7

Output

0 1 2 1 2 3 3

Note

In the first sample case desired sequences are:

1: 1; *m*_{1} = 0;

2: 1, 2; *m*_{2} = 1;

3: 1, 3; *m*_{3} = |3 - 1| = 2.

In the second sample case the sequence for any intersection 1 < *i* is always 1, *i* and *m*_{i} = |1 - *i*|.

In the third sample case — consider the following intersection sequences:

1: 1; *m*_{1} = 0;

2: 1, 2; *m*_{2} = |2 - 1| = 1;

3: 1, 4, 3; *m*_{3} = 1 + |4 - 3| = 2;

4: 1, 4; *m*_{4} = 1;

5: 1, 4, 5; *m*_{5} = 1 + |4 - 5| = 2;

6: 1, 4, 6; *m*_{6} = 1 + |4 - 6| = 3;

7: 1, 4, 5, 7; *m*_{7} = 1 + |4 - 5| + 1 = 3.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Sep/21/2021 18:19:18 (h2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|