#include <iostream>
#include <cmath>
#include <cstdio>
using namespace std;
long long GCD(long long A, long long B) {
    if (B == 0) return A;
    else return GCD(B, A % B);
}
int main() {
    long double N; cin >> N;
    long long bunbo = 1;
    while (N - floor(N) != 0) {
        N *= 10;
        bunbo *= 10;
    }
    long long bunsi = N;
    cout << bunbo / GCD(bunbo, bunsi) << ' ' << bunsi / GCD(bunbo, bunsi) << endl;
}