
#include<bits/stdc++.h>
using namespace std;
int n;
string s1,s2,s;
string j(string s1,string s2){//高精加
int i,x,lena,lenb,lenc,j;
lena=s1.size();
int a[1001],b[1001],c[1001];
lenb=s2.size();
for(int i=0;i<lena;i++)a[lena-i]=s1[i]-'0';
for(int i=0;i<lenb;i++)b[lenb-i]=s2[i]-'0';
i=1;
x=0;
while(i<=lena||i<=lenb)
{
c[i]=a[i]+b[i]+x;
x=c[i]/10;
c[i]=c[i]%10;
i++;
}
c[i]=x;
lenc=i;
while(lenc>1&&c[lenc]==0)lenc--;
string ans;
for(i=lenc,j=0;i>=1;i--,j++)ans[j]=c[i];
return ans;
}
bool cmp(string s1,string s2){?/字符串比较
if(s1.size()==s2.size()){
for(int i=0;i<s1.size();i++){
if(s1[i]==s2[i])continue;
if(s1[i]>s2[i])return true;
else if(s1[i]<s2[i])return false;
}
}
else{
if(s1.size()>s2.size())return true;
else return false;
}
}
int main()
{
cin>>n;
for(int i=1;i<=n;i++){
cin>>s;
s1=j(s,s1);
}
cout<<s1<<endl;
for(int i=1;i<=n;i++){
cin>>s;
s2=j(s,s2);
}
if(cmp(s1,s2))cout<<"win"<<endl;
else cout<<"lose"<<endl;
cout<<s1<<endl<<s2<<endl;
return 0;
}
