#include <stdio.h>
#include <queue>
using namespace std;
queue <char> q1, q2;
char cryptogram[500];
/*
void HowToFindCryptogram() {
	char binary='30110001 51011111 11001101 71101111 20110100 41001100 60110111'; //M41L_7o
	char X[200]="why you as devilyou..oh..oh"; //yuswoo09
	// binary_X09 : password?
}
*/
void shuffling(int n) { // 89 48 117 95 52 82 51 95 119 52 78 55 51 68 : Y0u_4R3_w4N73D
	if(n==0) return;
	for(int i=0; cryptogram[i]; i++) {
		if(i%2==0) q1.push(cryptogram[i]);
		else q2.push(cryptogram[i]);
	}
	int i;
	for(i=0; !q1.empty(); i++) {
		cryptogram[i]=q1.front();
		q1.pop();
	}
	for(int j=i; !q2.empty(); i++) {
		cryptogram[i]=q2.front();
		q2.pop();
	}
	if(cryptogram[22]=='7') {
        printf("%s\n", cryptogram);// 4lm057 th3R3..!
    }
	shuffling(n-1);
}

int main() {
	printf("D0 y0u rea!!y w4n7 7o jo1n s0sCoD3? [Y/N]\n");
	char answer[10];
	scanf(" %c", answer);
	if(answer[0]!='Y') printf("T^T");
	else {
		printf("Ok4y! en7er the CryP70gR4m.\n");
		scanf("%s", cryptogram);
		printf("8ow m4nY shuffles?\n");
		int number;
		scanf("%d", &number);
		if(number>90) {
			printf("Y0u d0n\'7 n33d TO..\n");
			return 0;
		}
		shuffling(number);
	}
}