#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <string>

#include <algorithm>
#include <complex>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <bitset>

using namespace std;

#ifdef _MSC_VER
#define __typeof__ decltype
#define strtok_r strtok_s
#endif

#define ITER(c)             __typeof__((c).begin())
#define FOREACH(it, c)      for (ITER(c) it=(c).begin(); it != (c).end(); ++it)
#define RITER(c)            __typeof__((c).rbegin())
#define RFOREACH(it, c)     for (RITER(c) it=(c).rbegin(); it != (c).rend(); ++it)
#define REP(i, n)           REPEAT(i, 0, n)
#define RREP(i, n)          RREPEAT(i, 0, n);
#define REPEAT(i, k, n)     for(int i = (k); i < (k+n); ++i)
#define RREPEAT(i, k, n)    for(int i = (k)+(n)-1; i >= (k); ++i)
#define ALL(c)              (c).begin(), (c).end()
#define LLPOW(p1,p2)        ((ll)pow((double)(p1), (int)p2))
#define ESIZEOF(A)          (sizeof(A)/sizeof((A)[0]))
#define MIN(p1,p2)          (((p1)<(p2))?(p1):(p2))
#define MAX(p1,p2)          (((p1)>(p2))?(p1):(p2))
#define CIN_NO_SYNC         do { cin.tie(0); ios_base::sync_with_stdio(false); } while(0)
#define GETSTR(p)           fgets((p), sizeof(p), stdin)
#define CHOMP(p)            do{ char *_q = (p) + strlen(p)-1; if(*_q == '\n' || *_q == '\r') *_q = 0; } while(0)
#define mp                  make_pair
#define pb                  push_back

typedef long long ll;
typedef unsigned long long ull;

#define X real()
#define Y imag()
typedef double D;
typedef complex<D> P;
#define EPS (1e-9)

#ifdef _DEBUG
#define pf printf
#define pr(n) do { cout << #n " = " << (n) << endl; } while(0)
#else
#define pf(...) /* */
#define pr(...) /* */
#endif

struct t {
    char code;
    const char *bs1;
    const char *bs2;
} table[] = {
    { ' ',  "101",      "11010" },
    { '\'', "000000",   "11110" },
    { ',',  "000011",   "11100" },
    { '-',  "10010001", "11101" },
    { '.',  "010001",   "11011" },
    { '?',  "000001",   "11111" },
    { 'A',  "100101",   "00000" },
    { 'B',  "10011010", "00001" },
    { 'C',  "0101",     "00010" },
    { 'D',  "0001",     "00011" },
    { 'E',  "110",      "00100" },
    { 'F',  "01001",    "00101" },
    { 'G',  "10011011", "00110" },
    { 'H',  "010000",   "00111" },
    { 'I',  "0111",     "01000" },
    { 'J',  "10011000", "01001" },
    { 'K',  "0110",     "01010" },
    { 'L',  "00100",    "01011" },
    { 'M',  "10011001", "01100" },
    { 'N',  "10011110", "01101" },
    { 'O',  "00101",    "01110" },
    { 'P',  "111",      "01111" },
    { 'Q',  "10011111", "10000" },
    { 'R',  "1000",     "10001" },
    { 'S',  "00110",    "10010" },
    { 'T',  "00111",    "10011" },
    { 'U',  "10011100", "10100" },
    { 'V',  "10011101", "10101" },
    { 'W',  "000010",   "10110" },
    { 'X',  "10010010", "10111" },
    { 'Y',  "10010011", "11000" },
    { 'Z',  "10010000", "11001" },
};



void solve(string &s){
    string bs;
    int n = ESIZEOF(table);
    FOREACH(it, s){
        char c = *it;
        REP(i,n){
            if(c == table[i].code){
                bs += table[i].bs1;
                break;
            }
        }
    }
    while(bs.size() % 5 != 0){
        bs += "0";
    }
    for(size_t i = 0; i < bs.size(); i += 5){
        string sbs = bs.substr(i,5);
        REP(j,n){
            if(sbs == table[j].bs2){
                printf("%c", table[j].code);
                break;
            }
        }
    }
    printf("\n");
}

int main(){
    string s;
    while(getline(cin,s)){
        solve(s);
    }
    return 0;
}

Measured memory_bytes: 1180