B. Secret Combination

B. Secret Combination

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You got a box with a combination lock. The lock has a display showing n digits. There are two buttons on the box, each button changes digits on the display. You have quickly discovered that the first button adds 1 to all the digits (all digits 9 become digits 0), and the second button shifts all the digits on the display one position to the right (the last digit becomes the first one). For example, if the display is currently showing number 579, then if we push the first button, the display will show 680, and if after that we push the second button, the display will show 068.

You know that the lock will open if the display is showing the smallest possible number that can be obtained by pushing the buttons in some order. The leading zeros are ignored while comparing numbers. Now your task is to find the desired number.

Input

The first line contains a single integer n (1 ≤ n ≤ 1000) — the number of digits on the display.

The second line contains n digits — the initial state of the display.

Output

Print a single line containing n digits — the desired state of the display containing the smallest possible number.

Sample test(s)

input

3
579

output

024

input

4
2014

output

0142

/*题目大意：给一整数，有两种方式、1、每位加1，其中9变为0，但不进位。2、整体向后移动一位、最后一位移动到首位
 *			问经过若干操作1与2后得到的最小数是多少
 *算法分析：可将环问题转换为链进行解决。然后每位累加，加10次依次进行比较即可，暴力完成 
*/

#include <bits/stdc++.h>
using namespace std;

char a[2200];
char b[2200], ans[2200];

int main() {
	int n;
	scanf("%d ",&n);
	memset(a, 0, sizeof(a));
	memset(b, 0, sizeof(b));
	memset(ans, 0, sizeof(ans));
	for (int i = 0; i<n; i++)	scanf("%c",&a[i]);
	strcpy(ans, a);
	//cout << ans << endl;
	for (int i = 0; i<n; i++)	a[n+i] = a[i];
	
	int t = 0;
	while (t <= 9) {
		for (int i = 0; i<2*n; i++)	{
			int tmp = a[i] - 48;
			tmp = (tmp+1) % 10;
			a[i] ='0' + tmp;
		}
		//cout << a << endl;
		t ++ ;
		for (int i = 0; i<n; i++) {
			int flag = 0;
			for (int j = i; j<i+n; j++) 	b[flag++] = a[j];
			if (strcmp(ans, b) > 0)		strcpy(ans, b);
			//cout << b << endl;
		}
		//cout << ans << endl;
	}
	cout << ans << endl;
	return 0;
}