OIG XIV - zyg

// tresc: https://szkopul.edu.pl/problemset/problem/DWvy9MNpOklIEXDvtVQZwGnO/site/?key=statement
// // OIG XIV (2 etap)

#include <algorithm>
#include <iostream>

long long __gcd(long long a, long long b) {
    if (b == 0) return a;
    a %= b;
    return __gcd(b, a);
}

int main() {
    std::string a;

    std::cin >> a;

    long long p = 0, g = 0;

    for (int i = 0; i < a.size(); i++) {
        if (a[i] == 'P') {
            p++;
        } else {
            g++;
        }
    }

    long long res = __gcd(p, g);

    long long x = 1, y = 0;

    std::string zg = "P";

    for (int i = 1; i < a.size(); i++) {
        if ((y + 1) * p <= g * x) {
            zg += "G";
            y++;
        } else {
            zg += "P";
            x++;
        }
    }

    if (a == zg) {
        std::cout << g / res << '/' << p / res;
    } else {
        std::cout << "NIE";
    }

    return 0;
}