//AC
#include <iostream>
#include <cstdlib>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
typedef long long ll;
using namespace std;
int main(){
string s;
int n;
cin>>n;
cin>>s;
if( n/2.0-n/2 >=0.5){
for (int i=1; i<=n/2+1; i++) {
for(int j=1;j<=n;j++){
cout<<s[0];
}
cout<<endl;
}
}
else{
for (int i=1; i<=n/2; i++) {
for(int j=1;j<=n;j++){
cout<<s[0];
}
cout<<endl;
}
}
return 0;
}
转载请注明原文地址: https://ju.6miu.com/read-36994.html
