#include <iostream>

 #include <cstring>

 #include <algorithm>

 #include <vector>

 #include <queue>

 #include <cmath>

 using namespace std;

 const int maxn =  + ;

 const int INF = 0x3f3f3f3f;

 int n, m;

 int power[];

 int d[][];

 int en[];

 int cnt;

 struct node

 {

     int s, e;

 }edge[maxn];

 void floyd()

 {

     for (int k = ; k <= n; k++)

     for (int i = ; i <= n; i++)

     for (int j = ; j <= n; j++)

     {

         d[i][j] = d[i][j] || (d[i][k] && d[k][j]);

     }

 }

 bool bellman_ford()

 {

     for (int i = ; i <= n; i++)   en[i] = -INF;

     en[] = ;

     for (int i = ; i < n; i++)

     {

         bool flag = false;

         for (int j = ; j <cnt; j++)

         {

             if (en[edge[j].e] < en[edge[j].s] + power[edge[j].e] && en[edge[j].s]+power[edge[j].e]>)

             {

                 en[edge[j].e] = en[edge[j].s] + power[edge[j].e];

                 flag = true;

             }

         }

         if (!flag)  break;

     }

     for (int j = ; j < cnt; j++)

     {

         //这儿需要注意一下，判断正环的时候，这个正环必须能到达终点

         if (en[edge[j].e] < en[edge[j].s] + power[edge[j].e] && en[edge[j].s] + power[edge[j].e]> && d[edge[j].e][n])  return true;

     }

     if (en[n] <= )     return false;

     else return true;

 }

 int main()

 {

     //freopen("D:\\input.txt", "r", stdin);

     int v;

     while (cin >> n && n != -)

     {

         memset(d, , sizeof(d));

         cnt = ;

         for (int i = ; i <= n; i++)

         {

             scanf("%d%d", &power[i], &m);

             while (m--)

             {

                 scanf("%d", &v);

                 edge[cnt].s = i;

                 edge[cnt].e = v;

                 d[i][v] = ;

                 cnt++;

             }

         }

         floyd();     //首先判断1到n是否连通

         if (!d[][n])

         {

             printf("hopeless\n");

             continue;

         }

         if (bellman_ford())

             printf("winnable\n");

         else

             printf("hopeless\n");

     }

 }