//经过疯狂化简后的简短代码
//首先小数部分是很好读的，直接输出就可以了
//整数部分可以划分为三个部分：个位（1~4），万位（5~8），亿位（9）
//最好处理的是亿位，因为只有一个所以直接输出就好，个位的处理也相对容易，记得要维护0的情况
//对于万位，我们存一下万位上是否有输出，同时要注意从万位到个位时要更新0
#include<iostream>
#include<cstring>
using namespace std;
char a[60],z[60],x[60],hao[10]={'Y','F','S','B','Q','W','S','B','Q','Y'};
int main()
{
    int n,i,ling=0,dian=0,zw=0,xw=0,wan=0,w;
    cin>>a;
    n=strlen(a);
    for(i=0;i<n;i++)
    {
        if(a[i]=='-')
         {
            cout<<"F";
            continue;
         }
        if(a[i]=='+')
         continue;
        if(a[i]=='0')
         if(!ling)
          continue;
        if(a[i]=='.')
         {
            dian=1;
            ling=1;
            continue;
         }
        ling=1;
        if(dian)
         x[++xw]=a[i];
        else
         z[++zw]=a[i];
    }
    ling=0;
    for(i=1;i<=zw;i++)
    {
         w=zw-i+1;
         if(z[i]!='0')
          {
            if(ling)
             {
                cout<<0;
                ling=0; 
             }
            cout<<z[i];
            if(w!=1)
             cout<<hao[w];
            if(w==8||w==7||w==6)
             wan=1;
         }
         else
          ling=1;
        if(w==5)
         {
            if(z[i]=='0'&&wan==1)
             {
                cout<<"W";
                  ling=0;
             }
         }
    }
    if(!zw)
     cout<<0;
    if(xw)
     cout<<"D";
    for(i=1;i<=xw;i++)
     cout<<x[i];
    return 0;
}
}

import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Scanner;

public class Main {
    static FileReader fr;
    static String number;
    
    public static Scanner getInput() {
        return new Scanner(System.in);
    }

//  public static Scanner getInput() throws IOException {
//      File f = new File("input.txt");
//      fr = new FileReader(f);
//      Scanner sc = new Scanner(fr);
//
//      return sc;
//  }
    
    public static void input() throws IOException {
        Scanner sc = getInput();
        number = sc.next();
        if (fr != null) {
            fr.close();
        }
    }

    private final static String[] unit = {"", "S", "B", "Q"};
    private final static String[] gunit = {"", "W", "Y"};
    private static String encode(int number, boolean isHighest) {
        int[] bitNumber = new int[4];
        for (int i = 0; i < 4; i++) {
            bitNumber[i] = number%10;
            number= number / 10;
        }

        boolean isZero = (bitNumber[3] == 0 && !isHighest);
        StringBuffer buffer = new StringBuffer();
        for (int index = 3; index >= 0; index --) {
            if (bitNumber[index] > 0) {
                if (isZero) {
                    buffer.append("0");
                }
                buffer.append(String.format("%d%s", bitNumber[index], unit[index]));
                isZero = false;
                isHighest = false;
            }else {
                if (!isHighest) {
                    isZero = true;
                }
            }
        }
        
        return buffer.toString();
    }

    private static String algorithm() {
        char[] c = number.toCharArray();
        int dotPos = number.indexOf(".");
        boolean isNegative = number.indexOf("-") >= 0;
        
        StringBuffer buffer = new StringBuffer();
        buffer.append(isNegative?"F":"");
        
        int firstPos = 10086;
        for (int i = 0; i < c.length; i++) {
            if (c[i] == '.') {
                break;
            }
            if (c[i] >= '1' && c[i] <= '9') {
                firstPos = i;
                break;
            }
        }
        
        int[] number = new int[3];
        int integerLastPos = dotPos > 0 ? dotPos:c.length;

        int byteCount = 0;
        int accu = 0;
        int highestGroup = 0;
        int tmp = 0;
        for (int i = integerLastPos - 1; i>=firstPos; i--) {
            if (byteCount % 4 == 0 && byteCount > 0) {
                number[highestGroup] = accu;
                highestGroup ++;
                accu = 0;
                tmp = 0;
            }
            accu = accu + (c[i] - 48) * (int) Math.pow(10, tmp);
            tmp++;
            byteCount++;
        }
        if (accu > 0) {
            number[highestGroup] = accu;
            accu = 0;
        }
        

        boolean isZero = true;
        for (int i = 2; i>=0; i--) {
            if (number[i]>0) {
                isZero = false;
                String value = encode(number[i], highestGroup ==i);
    //          if (!value.equals("")) {
                    buffer.append(String.format("%s%s", value, gunit[i]));
    //          }
            }
        }
        if (isZero) {
            if (dotPos == -1) {
                return "0";
            }else {
                boolean isAllZero = true;
                for (int i = dotPos + 1; i < c.length; i++) {
                    if (c[i] != '0') {
                        isAllZero = false;
                        break;
                    }
                }
                if (isAllZero) {
                    buffer.delete(0, buffer.length());
                }
            }
            buffer.append("0");
        }
        if (dotPos != -1) {
            byteCount = dotPos - firstPos;
            
            StringBuffer buffer2 = new StringBuffer();
            for (int i = dotPos + 1; i < c.length; i++) {
                buffer2.append(c[i]);
            }
            if (buffer2.length() > 0) {
                buffer.append("D");
                buffer.append(buffer2.toString());
            }
        }
        return buffer.toString();
    }
    
    public static void output(String result) {
        System.out.println(result);
    }

    public static void main(String args[]) throws IOException {
        input();
        String result = algorithm();
        output(result);
    }

}