#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <vector>
#include <list>
#include <string>
#include <iostream>
#include <algorithm>

using namespace std;

char arr[1000][1000];

int main(int argc, char **argv) {
	
	int n;
	scanf ("%d\n", &n);
	while (n) {
		char inp[1001];
		char inp2[1001];
		fgets(inp, 1000, stdin);
		int j = 0;
		for (int i = 0; i < strlen(inp); i++) {
			char &c = inp[i];		
			if (c == ' ' || c == '\n')
				continue;
			inp2[j++] = toupper(c);
		}
		inp2[j++] = '\0';
		int riadkov = n;
		int stlpcov = strlen(inp2) /n;
		if (strlen(inp2) % n != 0) stlpcov ++;
		int volnych = riadkov * stlpcov - strlen(inp2);
		int start_ommit = riadkov - volnych;

		int	jpind = 0;
		for (int i=0; i<riadkov; i++) {
			for (j=0; j<stlpcov; j++) {
				if (j<stlpcov-1 || i < start_ommit) {
					arr[i][j] = inp2[jpind++]; 
				}
			}
		}
		for (int i=0; i<stlpcov; i++) {
			for (j = 0; j<riadkov; j++) {
				printf("%c", arr[j][i]);
				arr[j][i] = '\0';
			}
		}
		printf("\n");
		scanf("%d\n", &n);
	}
	return 0;
}