#include <iostream>
#include <algorithm>

using namespace std;

const int n = 15;

void scan(int *mas)
{
	for (int i = 0; i < n; i++)
		cin >> mas[i];
}

void print(int *mas)
{
	for (int i = 0; i < n; i++)
		cout << mas[i] << " ";
	cout << endl;
}

void trans(int *mas)
{
	int max = mas[0], min = mas[0], imax = 0, imin = 0;
	for (int i = 0; i < n; i++)
	{
		if (mas[i] > max)
		{
			imax = i;
			max = mas[i];
		}
		if (mas[i] < min)
		{
			imin = i;
			min = mas[i];
		}
	}
	int size = abs(imax - imin) + 1;
	int *b = new int [size];

	if (imin > imax)
		swap(imin, imax);
	for (int i = imin, j = 0; i <= imax; i++, j++)
		b[j] = mas[i];
	for (int i = imin, j = size-1; i <= imax && j >= 0; i++, j--)
		mas[i] = b[j];

	delete [] b;
}

int main()
{
	int a[n];
	scan(a);
	trans(a);
	print(a);
	return 0;
}