#include<bits/stdc++.h>
using namespace std;
int n;
array<int,4> ans;
int rem[10][150005];
int lmp[10][100005], rmp[10][100005];
bool operator<(array<int,4> a, array<int,4> b){
	if(b[0] == 0) return true;
	assert(a[0] + a[2] == b[0] + b[2]);
	if(a[1] != b[1]) return a[1] < b[1];
	if(b[0] > a[0]) return a[3] < b[1];
	else if(a[0] > b[0])return a[1] < b[3];
	else return a[3] < b[3];
}

int toint(array<int,4> ar){
	if(ar[0]+ar[2] > 6) return -1;
	int ans = 0;
	for(int i=0;i<ar[0];i++) ans = ans*10+ar[1];
	for(int i=0;i<ar[2];i++) ans = ans*10+ar[3];
	return ans;
}

void solve(){
	ans = {0, 0, 0, 0}; 
	memset(lmp, 0, sizeof(lmp));
	memset(rmp, 0x3f, sizeof(rmp));
	for(int i=1;i<=9;i++){
		for(int j=1;j<=150000;j++){
			rem[i][j] = (rem[i][j-1] * 10 + i) % n;
		}
	}
	for(int i=1;i<=9;i++) lmp[i][rem[i][1]] = rmp[i][rem[i][1]] = 1;
	for(int dig=2;dig<=100005;dig++){
		for(int i=1;i<=9;i++){
			int re = rem[i][dig];
			for(int j=1;j<=i;j++){
				if(lmp[j][re] > 0){
					array<int, 4> ar = {dig - lmp[j][re], i, lmp[j][re],i-j};
					if(toint(ar) != n && (ans[0] == 0 || ar < ans)) ans = ar;
				}
			}
			re = (n - re) % n;
			for(int j=1;i+j<10;j++){
				if(rmp[j][re] < dig){
					array<int, 4> ar = {dig - rmp[j][re], i, rmp[j][re],i+j};
					if(toint(ar) != n && (ans[0] == 0 || ar < ans)) ans = ar;
				}
			}
		}
		if(ans[0] != 0){
			cout<<n<<": "<<ans[0]<<" "<<ans[1]<<" "<<ans[2]<<" "<<ans[3]<<'\n';
			return;
		}
		for(int i=1;i<=9;i++){
			lmp[i][rem[i][dig]] = max(lmp[i][rem[i][dig]], dig);
			rmp[i][rem[i][dig]] = min(rmp[i][rem[i][dig]], dig);
		}
	}
}

int main(){
	ios::sync_with_stdio(0), cin.tie(0);
	while(cin>>n){
		if(n==0) break;
		solve();
	}
}