#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <time.h>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <cstring>

using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iostream>

using namespace __gnu_pbds;
using namespace std;
template <class T>
using Tree =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// to erase in multiset-> less_equal<T> and 
// s.erase(s.find_by_order(s.order_of_key(x)))
// lower_bound(x)=>(cannot use the stl lower_bound function)
// ll idx = s.order_of_key(x)
// if(idx == s.size()) -> no lower_bound
// else lb = *s.find_by_order(idx) // as 0-indexing
// idx-1 will give highest value which is strictly less than x
// for upper_bound->do the same with (x+1)

typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef tuple<ll, ll, ll> t64;
typedef vector<t64> vt64;
typedef vector<vt64> vvt64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<vector<p64> > vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
typedef vector<vector<p32> > vvp32;
typedef vector<bool> vb;
ll mod =  1e9+7, MOD = 998244353;
double eps = 1e-12;
// #define forn(i,e) for(ll i = 0; i < e; i++)
#define FOR(s, e, i) for(int i = s; i <= e; i++)
// #define rforn(i,s) for(ll i = s; i >= 0; i--)
#define ROF(s ,e, i) for(int i = s; i >= e; i--)
#define coutAll(A) for(auto asdafas : A) cout <<  asdafas << " "; cout << "\n";
#define foutAll(A) for(auto asdafas : A) fout <<  asdafas << " "; cout << "\n";
#define cinAll(A) for(auto &asdafas : A) cin >>  asdafas;
#define finAll(A) for(auto &asdafas : A) fin >>  asdafas;
#define minpq priority_queue<ll, v64, greater<ll>>
#define maxpq priority_queue<ll> 
#define ln "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define fi first
#define se second
ll inf = LLONG_MAX;
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef pair<ll, ll> pll;
typedef pair<ll, ll> pii;
#define MAXN 1000000

void solve(int it)
{
    string s;
    cin >> s;
    int a = 0;
    int id = 0;
    for(id = 0; s[id] != '/'; ++id){
        a = a * 10 + (s[id]-'0');
    }
    ++id;
    int b = 0;
    for(; id < s.size(); ++id){
        b = b * 10 + (s[id]-'0');
    }
    int g = __gcd(a, b);
    a /= g;
    b /= g;
    int tempa, tempb;
    tempa = a, tempb =b;
    bool ok = false;
    id = 2;
    while(!(tempb-1<=tempa&&tempa<=tempb*(tempb-1)/2) && tempb < MAXN){
        tempb = b * id;
        tempa = a * id;
        ++id;
    }
    if(tempb > MAXN){
        cout << "impossible";
        return;
    }
    a = tempa;
    b = tempb;
    if(!(b-1<=a&&a<=b*(b-1)/2)){
        cout << "impossible";
        return;
    }
    vv32 adj(b);
    FOR(0, b - 2, i){
        adj[i].pb(i+1);
    }
    int edges_cnt = b*(b-1)/2;
    // cout << edges_cnt << " " << a << "\n";
    int last = b-1, par = b-2;
    while(edges_cnt > a){
        if(par == 0){
            last--;
            par = last-1;
            continue;
        }
        --edges_cnt;
        adj[par].pop_back();
        --par;
        adj[par].pb(last);
    }
    cout << b << " " << b-1 << "\n";
    FOR(0, b - 1, i){
        for(auto v : adj[i]){
            cout << i+1 << " " << v+1 << "\n";
        }
    }








}


int main()
{
    fast_cin();    
    ll t = 1;
    // cin >> t;
    for(int it=1; it<=t; it++)
    {
        //cout << "Case " << it << ": ";
        solve(it);
    }
    return 0;
}