/**
 *    author:  longvu
 *    created: 07/21/24 16:35:51
**/
#include<bits/stdc++.h>

using namespace std;

#define int long long
#define sz(x) ((int)x.size())
#define all(x) (x).begin(), (x).end()
const int INF = numeric_limits<int>::max();
const int nax = (int)(100001);
const int mod = 1e9 + 7;

template<class X, class Y>
bool maximize(X& x, const Y y) {
    if (y > x) {x = y; return true;}
    return false;
}
template<class X, class Y>
bool minimize(X& x, const Y y) {
    if (y < x) {x = y; return true;}
    return false;
}

int gcd(int a, int b) {
    return (!b ? a : gcd(b, a % b));
}

int d[nax];
int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    string s;
    cin >> s;
    int x = 0, y = 0;
    for (int i = 0; i < sz(s); ++i) {
        if (s[i] == '/') {
            for (int j = 0; j < i; ++j) {
                x = 10 * x + (s[j] - '0');
            }
            for (int j = i + 1; j < sz(s); ++j) {
                y = 10 * y + (s[j] - '0');
            }
        }
    }
    int _gcd = gcd(x, y);
    x /= _gcd;
    y /= _gcd;
    if (x >= 2 && y == 1) {
        cout << 2 * x + 1 << " " << 2 * x << '\n';
        for (int i = 2; i <= 2 * x + 1; ++i) {
            cout << i - 1 << " " << i << '\n';
        }
        exit(0);
    }
    int a = x, b = y;
    while (a <= 1e6 && b <= 1e6) {
        if (a >= b - 1 && (b - 1) * b / 2 >= a) {
            int z = a, t = b;
            b--;
            int g = 0;
            for (int i = b - 1; i >= 1; --i) {
                if (b - 1 - i <= a - i * (i + 1) / 2) {
                    g = i;
                    for (int j = 1; j <= i; ++j) {
                        d[j]++;
                        a -= j;
                    }
                    b -= i;
                    break;
                }
            }
            int need = a - (b - 1);
            d[need]++;
            a -= need;
            b--;
            if (!need) {
                d[g]--;
                d[g - 1]++;
                d[1]++;
                g--;
            }
            for (int i = 1; i <= b; ++i) {
                d[1]++;
            }
            // cout << a << " " << g << '\n';
            int h = 0;
            for (int i = 1; i <= t; ++i) {
                h += d[i];
            }
            // cout << "BU" << '\n';
            // for (int i = 1; i <= t; ++i) {
            //     cout << d[i] << " ";
            // }
            // cout << '\n';
            int sum = 0;
            for (int i = 1; i <= t; ++i) {
                sum += i * d[i];
            }
            assert(sum == z);
            cout << t << " " << h << '\n';
            int num = g + 1;
            for (int i = 1; i <= t; ++i) {
                if (!d[i]) {
                    break;
                }
                cout << i << " " << i + 1 << '\n';
                for (int j = 2; j <= d[i]; ++j) {
                    cout << i << " " << ++num << '\n';
                }
            }
            exit(0);
        }
        a += x;
        b += y;
    }
    cout << "impossible" << '\n';
    return 0;
}