#include <iostream>

#include <stdio.h>

#include <string.h>

#include <queue>

using namespace std;

bool ism[5][5];

int a[5][5];

int dx[4]={0, 1, 0, -1};

int dy[4] = { 1, 0, -1, 0 };

struct Node{

    int x;

    int y;

    int s;

    short l[30];

};

bool judge(int x, int y){

    if (x < 0 || x >= 5 || y < 0 || y >= 5)

        return true;

    if (ism[x][y])

        return true;

    if (a[x][y] == 1)

        return true;

    return false;

}

Node bfs(){

    queue<Node> q;

    Node cur, next;

    cur.x = 0;

    cur.y = 0;

    cur.s = 0;

    ism[cur.x][cur.y] = true;

    q.push(cur);

    while (!q.empty()){

        cur = q.front();

        q.pop();

        if (cur.x == 4 && cur.y == 4)

            return cur;

        int i, nx, ny;

        for (i = 0; i < 4; i++){

            nx = cur.x + dx[i];

            ny = cur.y + dy[i];

            if (judge(nx, ny))

                continue;

            next = cur;

            next.x = nx;

            next.y = ny;

            next.s = cur.s+1;

            next.l[cur.s] = i;

            q.push(next);

        }

    }

    return cur;

}

int main(){

    int i, j;

    for (i = 0; i < 5; i++){

        for (j = 0; j < 5; j++){

            scanf("%d", &a[i][j]);

        }

    }

    memset(ism, 0, sizeof(ism));

    Node ans = bfs();

    int x, y;

    x = 0, y = 0;

    for (i = 0; i<= ans.s; i++){

        printf("(%d,%d)\n", x, y);

        x += dx[ans.l[i]];

        y += dy[ans.l[i]];

    }

    return 0;

}