#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
const int S = 300;
int l, p, q, d;
char s[S], t[S];
bool du(int x) {
    p += 4;
    if(!(s[x]+s[x-1]+s[x-2]+s[x-3])) return false;
    if(s[x-3]) t[q++] = s[x-3]+'0', t[q++] = 'Q';
    if(q>3) if(!s[x-3] && s[x-2]) t[q++] = '0';
    if(s[x-2]) t[q++] = s[x-2]+'0', t[q++] = 'B';
    if(s[x-1]) t[q++] = s[x-1]+'0', t[q++] = 'S';
    if(!(s[x-1]+s[x-2]+s[x-3])) t[q++] = '0';
    else if(!(s[x-1]+s[x-2])) t[q++] = '0';
    if(s[x]) t[q++] = s[x]+'0';
    fprintf(stderr, "(%d%d%d%d)", s[x-3],s[x-2],s[x-1],s[x]);
    return true;
}
int main() {
    freopen("readrule.in", "r", stdin);
    freopen("readrule.out", "w", stdout);
    scanf("%s\n", s);
    l = strlen(s);
    if(s[0] == '-' || s[0] == '+') p = 1;
    while(s[p] == '0') p++;
    while(s[d] != '.' && d < l) d++;
    for(int i=1; i<p; i++) s[i] = 0;
    for(int i=p; i<d; i++) s[i] -= '0';
    if(d-p > 8)
        if(du(d-9)) t[q++] = 'Y';
    if(d-p > 4)
        if(du(d-5)) t[q++] = 'W';
    if(d-p > 1)
        du(d-1);
    if(!q) t[q++] = '0';
    if(s[d] == '.') {
        t[q++] = 'D';
        for(int i=d+1; i<l; i++)
            t[q++] = s[i];
    }
    if(s[0] == '-') printf("F");
    printf("%s\n", t);
    return 0;
}