uva 10978

本來以為是約瑟夫解，不過數字小 模擬即可

//============================================================================
// Name        : Let's Play Magic!.cpp
// Date : 2013/4/5 下午3:07:51
// Author : GCA
//============================================================================
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#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 10011
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
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 ans[60];
char x[60][30];
char y[60][30];
int main() {
    ios_base::sync_with_stdio(0);
    int n;
    while(~scanf("%d%*c",&n)&&n){
        for(int i=0;i<n;i++){
            scanf("%s %s",x[i],y[i]);
        }
        Set(ans,-1);
        for(int j=0,k,i=0;i<n;i++){
//            printf("%s %s\n",x[i],y[i]);
            int len=strlen(y[i]);
            for(k=0;;){
                if(ans[j]==-1)k++;
                if(k>=len){
                    ans[j]=i;
                    break;
                }
                j=(j+1)%n;
            }
//            ans[j]=i;
            j=(j+1)%n;
        }
//        for(int i=0;i<60;i++)printf("%d ",ans[i]);
//        Pln();
        printf("%s",x[ans[0]]);
        for(int i=1;i<n;i++){
            printf(" %s",x[ans[i]]);
        }Pln();

    }


}