[CodeForces][JAVA] 263A - Beautiful Matrix

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.StringTokenizer;
 
 
public class Solution {
        
    private static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    private static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
    
    public static void main(String[] args) throws IOException{
        // 문제 해결 방식 : matrix를 배열이라고 생각하고 인덱스인 (i,j)를 찾음
        // 한 가운데가 (2,2)니까 abs로 row와 column이동한 횟수 더해서 res값 구함
        
        int i=0, j=0;
        OuterLoop:
        for(i=0; i<5; i++) {
            StringTokenizer stk = new StringTokenizer(br.readLine()," ");
            int num = 0;
            for(j=0; j<5; j++) {
                num = Integer.parseInt(stk.nextToken());
                if(num ==1) break OuterLoop;
            }
        }
        int res = Math.abs(i-2)+Math.abs(j-2);
        bw.write(String.valueOf(res));
        bw.flush();
        
        
    }
}