#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>

#define Maxn 1000005

using namespace std;

int a, b, n, m, ans[Maxn];

int gcd(int x, int y) {
    if(x < y) swap(x, y);
    if(!y) return x;
    else return gcd(y, x % y);
}

int main() {
    scanf("%d/%d", &a, &b);
    int gcdab = gcd(a, b); a /= gcdab, b /= gcdab;
    if(a < b) {
        if(a == b - 1) {
            n = b, m = b - 1;
            printf("%d %d\n", n, m);
            for(int i = 1; i <= m; ++i) printf("%d %d\n", 1, i + 1);
        }
        else printf("Impossible\n");
        return 0;
    }
    int k = ceil((2 * a + b) * 1.0 / b / b);
    n = k * b, m = n - 1;
    int restSum = a * k, restVer = n - 1, tot = 0;
    while(restVer) {
        int cur = 1;
        while(cur * (cur + 1) / 2 + (restVer - cur) <= restSum) ++cur;
        --cur;
        ans[++tot] = cur;
        restSum -= cur * (cur + 1) / 2, restVer -= cur;
    }
    printf("%d %d\n", n, m);
    int u = 2;
    for(int i = 1; i <= tot; ++i) {
        printf("1 %d\n", u); ++u;
        for(int j = 2; j <= ans[i]; ++j) {
            printf("%d %d\n", u - 1, u); ++u;
        }
    }
    return 0;
}