#include<bits/stdc++.h>
using namespace std;

int nearest(int x, int y,vector<pair<int,int>> pos){
    int d = 1e9;
    for(int i = 0; i < pos.size(); i++){
        if ((abs(x - pos[i].first) + abs(y - pos[i].second)) < d)
            d = abs(x - pos[i].first) + abs(y - pos[i].second);
    }
    return d;

}
void find(int x, int y,vector<pair<int,int>>& pos) {
    for (int i = 0; i < pos.size(); i++) {
        if (pos[i].first == x && pos[i].second == y)
            pos.erase(pos.begin() + i);
    }
}

int main() {
    int s;
    string t;
    int grid[10][10];
    int x, y;
    vector<pair<int,int>> pos;
    cin >> s;
    
    for(int i = 0; i < 4; i++){
        s = s + floor(s/13) + 15;

        int z = s % 100;

        x = z / 10, y = z % 10;
        pos.emplace_back(make_pair(x,y));
        grid[x][y] = 1;

    }
    int user_score = 0;
    while (pos.size()) {
        cin >> t;
        x = t[0] - '0';
        y = t[1] - '0';
            
        if(grid[x][y] == 1){
            cout << "You hit a wumpus!" << endl;
            find(x,y,pos);
            grid[x][y] = 0;
            if (pos.size() != 0)
                cout << nearest(x,y,pos) << endl;
        }
        else {
            cout << nearest(x,y,pos) << endl;
        }
        user_score ++;
    }
    cout << "Your score is " << user_score << " moves." ;
}