Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

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

E. Three Swaps

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputXenia the horse breeder has *n* (*n* > 1) horses that stand in a row. Each horse has its own unique number. Initially, the *i*-th left horse has number *i*. That is, the sequence of numbers of horses in a row looks as follows (from left to right): 1, 2, 3, ..., *n*.

Xenia trains horses before the performance. During the practice sessions, she consistently gives them commands. Each command is a pair of numbers *l*, *r* (1 ≤ *l* < *r* ≤ *n*). The command *l*, *r* means that the horses that are on the *l*-th, (*l* + 1)-th, (*l* + 2)-th, ..., *r*-th places from the left must be rearranged. The horses that initially stand on the *l*-th and *r*-th places will swap. The horses on the (*l* + 1)-th and (*r* - 1)-th places will swap. The horses on the (*l* + 2)-th and (*r* - 2)-th places will swap and so on. In other words, the horses that were on the segment [*l*, *r*] change their order to the reverse one.

For example, if Xenia commanded *l* = 2, *r* = 5, and the sequence of numbers of horses before the command looked as (2, 1, 3, 4, 5, 6), then after the command the sequence will be (2, 5, 4, 3, 1, 6).

We know that during the practice Xenia gave at most three commands of the described form. You have got the final sequence of numbers of horses by the end of the practice. Find what commands Xenia gave during the practice. Note that you do not need to minimize the number of commands in the solution, find any valid sequence of at most three commands.

Input

The first line contains an integer *n* (2 ≤ *n* ≤ 1000) — the number of horses in the row. The second line contains *n* distinct integers *a*_{1}, *a*_{2}, ..., *a*_{n} (1 ≤ *a*_{i} ≤ *n*), where *a*_{i} is the number of the *i*-th left horse in the row after the practice.

Output

The first line should contain integer *k* (0 ≤ *k* ≤ 3) — the number of commads Xenia gave during the practice. In each of the next *k* lines print two integers. In the *i*-th line print numbers *l*_{i}, *r*_{i} (1 ≤ *l*_{i} < *r*_{i} ≤ *n*) — Xenia's *i*-th command during the practice.

It is guaranteed that a solution exists. If there are several solutions, you are allowed to print any of them.

Examples

Input

5

1 4 3 2 5

Output

1

2 4

Input

6

2 1 4 3 6 5

Output

3

1 2

3 4

5 6

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/24/2019 02:42:19 (d2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|