CodeForces 676A Nicholas and Permutation

A. Nicholas and Permutation

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Nicholas has an array a that contains n distinct integers from 1 to n. In other words, Nicholas has a permutation of size n.

Nicholas want the minimum element (integer 1) and the maximum element (integer n) to be as far as possible from each other. He wants to perform exactly one swap in order to maximize the distance between the minimum and the maximum elements. The distance between two elements is considered to be equal to the absolute difference between their positions.

Input

The first line of the input contains a single integer n (2 ≤ n ≤ 100) — the size of the permutation.

The second line of the input contains n distinct integers a1, a2, ..., an (1 ≤ ai ≤ n), where ai is equal to the element at the i-th position.

Output

Print a single integer — the maximum possible distance between the minimum and the maximum elements Nicholas can achieve by performing exactly one swap.

Examples

input

5
4 5 1 3 2

output

3

input

7
1 6 5 3 4 7 2

output

6

input

6
6 5 4 3 2 1

output

5

Note

In the first sample, one may obtain the optimal answer by swapping elements 1 and 2.

In the second sample, the minimum and the maximum elements will be located in the opposite ends of the array if we swap 7 and 2.

In the third sample, the distance between the minimum and the maximum elements is already maximum possible, so we just perform some unnecessary swap, for example, one can swap 5 and 2.

题意：给你1到n的n个数，任意交换两个数的位置，使最小值和最大值的距离最大，问最大距离是多少。

思路：要使距离最大，就要把最大或最小值放第一个或最后一个，分别求出这几种情况取最大值即可。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
	int n,i,j,k,l,m,a[1100];
	while(scanf("%d",&n)!=EOF)
	{
		for(i=1;i<=n;i++)
		{
			scanf("%d",&a[i]);
			if(a[i]==1)
			k=i;
			if(a[i]==n)
			l=i;
		}
		int a=max(l-1,k-1);
		int b=max(n-l,n-k);
		int c=max(abs(k-l),b);
		int d=max(c,a);
		printf("%d\n",d); 
	}
	return 0;
}