dp [i] 表示某行到第 i 個單字結束的時候最小的 badness
dp[i] = min{dp[i-1]+500,dp[j]+badness
(參考至http://www.cnblogs.com/staginner/archive/2011/12/07/2279059.html)
所以 dp [i] 當作是下一行的一個字
也可以當作接在別的字後面
如果當做下一行開始，則 dp [i-1] 就是上一行 + 500
接在別的字後面的話，dp [i+1] 到 dp [j] 組成一行
也就是
this___________ <=dp[1] 500
this__________is <=dp[2]
this___is____best <=dp[3]
然後再用 dp [2] 跟 dp [1] 做比對
this___________
is____________ dp[2]
this___________
is_____best____ dp[3]
this___________
is____________
best___________ dp[3]
//
// GGGGGGGGGGGGG CCCCCCCCCCCCC AAA
// GGG::::::::::::G CCC::::::::::::C A:::A
// GG:::::::::::::::G CC:::::::::::::::C A:::::A
// G:::::GGGGGGGG::::G C:::::CCCCCCCC::::C A:::::::A
// G:::::G GGGGGG C:::::C CCCCCC A:::::::::A
//G:::::G C:::::C A:::::A:::::A
//G:::::G C:::::C A:::::A A:::::A
//G:::::G GGGGGGGGGGC:::::C A:::::A A:::::A
//G:::::G G::::::::GC:::::C A:::::A A:::::A
//G:::::G GGGGG::::GC:::::C A:::::AAAAAAAAA:::::A
//G:::::G G::::GC:::::C A:::::::::::::::::::::A
// G:::::G G::::G C:::::C CCCCCC A:::::AAAAAAAAAAAAA:::::A
// G:::::GGGGGGGG::::G C:::::CCCCCCCC::::C A:::::A A:::::A
// GG:::::::::::::::G CC:::::::::::::::C A:::::A A:::::A
// GGG::::::GGG:::G CCC::::::::::::C A:::::A A:::::A
// GGGGGG GGGG CCCCCCCCCCCCCAAAAAAA AAAAAAA
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
#include <ctime>
using namespace std;
#ifdef DEBUG
#define VAR(a,b) decltype(b) a=(b)
#define debug(...) printf("DEBUG: "),printf(__VA_ARGS__)
#define gettime() end_time=clock();printf("now running time is %.7f\\n",(float)(end_time - start_time)/CLOCKS_PER_SEC);
#else
#define VAR(a,b) __typeof(b) a=(b)
#define debug(...)
#define gettime()
#endif
typedef unsigned int uint;
typedef long long int Int;
typedef unsigned long long int UInt;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp[htx][hty]);}Pln();}
#define M 10005
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define FOR(a,b) for(VAR(a,(b).begin());a!=(b).end();++a)
#define eps 1e-6
clock_t start_time=clock(), end_time;
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int n;
int m;
char str[M];
char word[M][M];
int wlen[M];
int lastline[M];
int dp[M];
int line[M];
int record[M][5];
inline int sqr(int s){
return s*s;
}
void printpath(int x){
int ls=lastline[x];
if(ls)printpath(ls);
if(ls+1==x){
printf("%s\\n",word[x]);
}else{
int j=ls+1;
for(int i=0;i<record[x][0];i++,j++){
printf("%s",word[j]);
for(int k=0;k<record[x][2];k++){
putchar(' ');
}
}
for(int i=0;i<record[x][1];i++,j++){
printf("%s",word[j]);
for(int k=0;k<=record[x][2];k++){
putchar(' ');
}
}
printf("%s\\n",word[j]);
}
}
void solve(){
Set(dp,0x3f);
Set(line,0x3f);
dp[0]=line[0]=0;
if(m==0)return;
for(int i=0;i<m;i++){
if(dp[i+1]>dp[i]+500){
dp[i+1]=dp[i]+500;
line[i+1]=line[i]+1;
lastline[i+1]=i;
}
int all=wlen[i+1];
for(int j=i+2;j<=m;j++){
int now=j-i-1;
all+=wlen[j];
if(all+now>n)break;
int eachspace=(n-all)/now;
int respace=n-all-eachspace*now;
int reachspace=now-respace;
int bad=reachspace*sqr(eachspace-1)+respace*sqr(eachspace);
if((dp[i]+bad<dp[j])||(dp[i]+bad==dp[j]&&line[i]+1<=line[j])){
dp[j]=dp[i]+bad;
line[j]=line[i]+1;
record[j][0]=reachspace;
record[j][1]=respace;
record[j][2]=eachspace;
record[j][3]=now;
lastline[j]=i;
}
}
}
printpath(m);
// printf("%d\\n",dp[m]);
}
int main() {
ios_base::sync_with_stdio(0);
while(~scanf("%d%*c",&n)&&n){
m=0;
while(gets(str)){
if(str[0]=='')break;
int len=strlen(str);
for(int j=0,k=0;k<len;){
m++;
sscanf(str+k,"%s",word[m]);
for(;str[k]!=' '&&str[k];k++);
for(;str[k]==' ';k++);
wlen[m]=strlen(word[m]);
}
}
solve();
Pln();
}
}