#include <stdio.h>

int s1Len, s2Len;
char cmd[20], output[200000], * oTop = output;

int main()
{
    while (gets(cmd) != NULL)
    {
        if (cmd[1] == 'u')
        {
            s1Len++;
            *oTop++ = '1';
        }
        else if (s2Len)
        {
            *oTop++ = '4';
            s2Len--;
        }
        else
        {
            s2Len = s1Len - 1;
            while (--s1Len)
                * oTop++ = '5';
            *oTop++ = '5', * oTop++ = '4';
        }
    }
    puts(output);
    return 0;
}

#include <stdio.h>
#include <stdlib.h>
#define MAX 10000

int kase, list[1000], tmp, nLen, gap, same, miss;
char input[MAX], ans;

int cmp(const int* lhs, const int* rhs)
{
    return *lhs - *rhs;
}

void setDigitList()
{
    tmp = nLen = 0;
    for (int i = 0; input[i]; i++)
    {
        if (input[i] == ' ')
            list[nLen++] = tmp, tmp = 0;
        else
            tmp = (tmp << 3) + (tmp << 1) + (input[i] - '0');
    }
    list[nLen++] = tmp;
}

int main()
{
    scanf(" %d", &kase);
    getchar();
    while (kase--)
    {
        gets(input);
        setDigitList();
        qsort(list, nLen, sizeof(int), cmp);
        gap = (list[nLen - 1] - list[0]) / (nLen - 1), ans = 0;
        for (int i = 1; i < nLen; i++)
        {
            if (list[i] != list[i - 1] + gap)
            {
                if (list[i] == list[i - 1])
                    same = list[i], ans++;
                else
                    miss = (list[i] + list[i - 1]) >> 1, ans++;
                if (ans == 2)
                    break;
            }
        }
        printf("%d %d\n", miss, same);
    }
    return 0;
}

#include <stdio.h>

const char A = 'A' - 10;
int b1, b2, rem, sum;
char input[2000], * output;

int main()
{
    while (scanf("%s %d %d", input, &b1, &b2) == 3)
    {
        output = input + 999;
        sum = 0;
        for (int i = 0; input[i]; i++)
        {
            if (input[i] <= '9')
                sum = sum * b1 + (input[i] - '0');
            else
                sum = sum * b1 + (input[i] - A);
        }
        while (sum)
        {
            rem = sum % b2;
            *--output = rem <= 9 ? rem + '0' : rem + A;
            sum /= b2;
        }
        puts(output);
    }
    return 0;
}

#include <stdio.h>
#define SIZE 10000

char input[SIZE], output[SIZE], conj[100], cLen, i, oLen;

int main()
{
    gets(input);
    for (i = 0; input[i] != ' '; i++)
        conj[cLen++] = input[i];
    i++;
    for (; input[i]; i++)
    {
        output[oLen++] = input[i];
        if (input[i] == ' ')
        {
            for (int j = 0; j < cLen; j++)
                output[oLen++] = conj[j];
            output[oLen++] = ' ';
        }
    }
    puts(output);
    return 0;
}

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

typedef struct Hash
{
    unsigned int Key, vLen;
    char Values[40][11];
    struct Hash* Next;
}Hash;

Hash* pList[32768];
Hash** now;
long long tmp;
unsigned int key, pLen;
char value[11];

inline unsigned int APHash(char src[])
{
    unsigned int hash = 0;
    char str[10] = { 0 };
    for (int i = 0; src[i]; i++)
        str[src[i] - '0']++;
    for (int i = 9; i; i--)
    {
        if (i & 1)
            hash ^= (~((hash << 11) ^ (str[i]) ^ (hash >> 5)));
        else
            hash ^= ((hash << 7) ^ (str[i]) ^ (hash >> 3));
    }
    return (hash & 0x7FFFFFFF);
}

inline void addHash(long long square)
{
    sprintf(value, "%lld", square);
    key = APHash(value);
    now = &pList[key & 32767];
    while (*now)
    {
        if ((*now)->Key == key)
        {
            strcpy((*now)->Values[(*now)->vLen++], value);
            return;
        }
        now = &(*now)->Next;
    }
    (*now) = malloc(sizeof(Hash));
    (*now)->Key = key;
    (*now)->vLen = 1;
    strcpy((*now)->Values[0], value);
    (*now)->Next = NULL;
}

inline void getAns(char src[])
{
    key = APHash(src);
    now = &pList[key & 32767];
    while (*now)
    {
        if ((*now)->Key == key)
        {
            for (int i = 0; i < (*now)->vLen; i++)
                printf("%s ", (*now)->Values[i]);
            putchar('\n');
            return;
        }
        now = &(*now)->Next;
    }
    puts("0");
}

int main()
{
    for (long long i = 34; i < 100000; i++)
    {
        tmp = i * i;
        while (tmp % 10)
            tmp /= 10;
        if (!tmp)
            addHash(i * i);
    }
    while (scanf(" %s", value) == 1)
    {
        getAns(value);
    }
    return 0;
}

#include <stdio.h>

char input[10000], curr, bestC;
int count, best;

int main()
{
    while (scanf(" %s", input) == 1)
    {
        count = best = 0;
        for (int i = 0; input[i]; i++)
        {
            if (input[i] == curr)
                count++;
            else
            {
                if (best < count)
                    best = count, bestC = curr;
                count = 1, curr = input[i];
            }
        }
        if (best < count)
            best = count, bestC = curr;
        printf("%c %d\n", bestC, best);
    }
    return 0;
}

#include <stdio.h>

char sky[][4] = { "甲", "乙", "丙", "丁", "戊", "己", "庚", "辛", "壬", "癸" };
char grd[][4] = { "子", "丑", "寅", "卯", "辰", "巳", "午", "未", "申", "酉", "戌", "亥" };

int main()
{
    int n;
    while (scanf(" %d", &n) == 1)
    {
        n = (n - 1744) % 60;
        printf("%s%s\n", sky[n % 10], grd[n % 12]);
    }
    return 0;
}

#include <stdio.h>

int n;
char Zodiac[][4] = { "豬", "鼠", "牛", "虎", "兔", "龍", "蛇", "馬", "羊", "猴", "雞", "狗" };

int main()
{
    while (scanf(" %d", &n) == 1)
    {
        puts(Zodiac[(n < 0 ? n + 121 : n) % 12]);
    }
    return 0;
}

#include <stdio.h>

int ans;
char list[11];

int main()
{
    while (scanf(" %s", &list) == 1)
    {
        ans = 0;
        for (int i = 0; list[i]; i++)
        {
            if (list[i] == '0') ans++;
            else if (list[i] == '6') ans++;
            else if (list[i] == '8') ans += 2;
            else if (list[i] == '9') ans++;
        }
        printf("%d\n", ans);
    }
    return 0;
}

#include <stdio.h>

int n, tmp, convert, best;

int main()
{
    scanf(" %d", &n);
    while (n--)
    {
        convert = 0;
        scanf(" %d", &tmp);
        while (tmp)
        {
            convert = convert * 10 + (tmp % 10);
            tmp /= 10;
        }
        if (best < convert)
            best = convert;
    }
    printf("%d\n", best);
    return 0;
}