#include <bits/stdc++.h>
using namespace std;
#define int long long
pair<int,int> parse(string s){
	for(int i = 0; i<s.size(); i++){
		if(s[i]=='/'){
			int a = stoll(s.substr(0,i));
			int b = stoll(s.substr(i+1));
			return make_pair(a,b);
		}
	}
	return {0,0};
}
signed main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	/*
	anything < 1 that's not n-1/n is not possible
	n-1/n is possible
	1/1 is possible

	
	*/
	string s;
	cin >> s;
	auto [a,b] = parse(s);
	if(a<b-1){
		cout << "impossible\n";
		return 0;
	}
	if(a<b){
		cout << b << ' ' << b-1 << '\n';
		for(int i = 1; i<b; i++){
			cout << i << ' ' << b << '\n';
		}
		return 0;
	}
	/*
	a,b

	ka = 5c*(kb-1)
	7c = ka-kb+1;


	*/
	vector<int>vals = {5, 14, 19, 41, 46};
	map<int,int>sz;
	sz[5] = 2;
	sz[14] = sz[19] = 3;
	sz[41] = sz[46] = 4;
	map<int,vector<int>>dx;
	dx[5] = {1,0};
	dx[14] = {1,0,-1};
	dx[19] = {1,1,0};
	dx[41] = {1,2,-1,0};
	dx[46] = {1,1,1,0};
	vector<int>dp(200005);
	dp[0] = 1;
	const int mxn = 200005;
	for(int i = 1; i<mxn; i++){
		for(int nxt: vals){
			if(i-nxt>=0 && dp[i-nxt]){
				dp[i] = nxt;
			}
		}
	}
	a*=100; b*=100;
	int dif = a-(b-1);
	vector<int>ans(b+1,b);
	int cur = 1;
	while(dif > 0){
		int v = dp[dif];
		for(int i = 0; i<sz[v]; i++){
			int val = dx[v][i];
			if(val==0)continue;
			ans[cur+i] = cur+i+val;
		}
		dif-=v;
		cur+=sz[dif];
	}
	cout << b << ' ' << b-1 << '\n';
	for(int i = 1; i<b; i++){
		cout << i+1 << " " << ans[i]%b+1 << '\n';
	}
	return 0;
}