CF263A Beautiful Matrix

You've got a $ 5×5 $ matrix, consisting of $ 24 $ zeroes and a single number one. Let's index the matrix rows by numbers from $ 1 $ to $ 5 $ from top to bottom, let's index the matrix columns by numbers from $ 1 $ to $ 5 $ from left to right. In one move, you are allowed to apply one of the two following transformations to the matrix: 1. Swap two neighboring matrix rows, that is, rows with indexes $ i $ and $ i+1 $ for some integer $ i $ $ (1

The input consists of five lines, each line contains five integers: the $ j $ -th integer in the $ i $ -th line of the input represents the element of the matrix that is located on the intersection of the $ i $ -th row and the $ j $ -th column. It is guaranteed that the matrix consists of $ 24 $ zeroes and a single number one.

Print a single integer — the minimum number of moves needed to make the matrix beautiful.