#define taskname "E"
#include <bits/stdc++.h>
#define ii pair<int,int>
#define ff first
#define ss second

using namespace std;

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    int x = 0, y = 0;
    string s;
    cin>>s;
    for (char c: s)
    {
        if (c != '/')
        {
            int a = c - '0';
            x = x * 10 + a;
        }
        else swap(x, y);
    }
    swap(x, y);
    if (y - x > 1 || max(x, y) == 1) return cout<<"impossible", 0;
//    cout<<"BEF: "<<x<<" "<<y<<"\n";
    int cx = x, cy = y;
    while (2 * x > y * (y - 1)) y += cy, x += cx;
//    cout<<x<<" "<<y<<"\n";
    /**
    dep * (dep + 1) / 2 <= x
    **/
    int dep = sqrt(2*x);
    if (dep * (dep + 1) > x) dep--;
    vector<ii> e;
    while ((x - dep * (dep + 1) / 2) < (y - dep - 1)) dep--;
    int cnt = dep + 1;
    for (int i=2; i<=cnt; i++) e.emplace_back(i-1, i);
    x -= dep * (dep+1) / 2;
    int rem = y - dep - 1;
    while (x > rem)
    {
        int mdep = min(dep, x + 1 - rem);
        e.emplace_back(++cnt, mdep);
        x -= mdep;
        rem--;
    }
    assert(x == rem);
    for (int i=1; i<=x; i++) e.emplace_back(++cnt, 1);
    cout<<cnt<<" "<<e.size()<<"\n";
    for (auto [u, v]: e) cout<<u<<" "<<v<<"\n";
}