from collections import deque

def shortest_path(grid):
    m, n = len(grid), len(grid[0])
    # 方向数组：上、下、左、右
    dirs = [(-1,0),(1,0),(0,-1),(0,1)]
    # 记录虫洞配对
    holes = []
    for i in range(m):
        for j in range(n):
            if grid[i][j] == '2':
                holes.append((i,j))
            elif grid[i][j] == 'S':
                sx, sy = i, j
    teleport = {}
    # 两两配对
    for i in range(0, len(holes), 2):
        a, b = holes[i], holes[i+1]
        teleport[a] = b
        teleport[b] = a

    vis = [[False]*n for _ in range(m)]
    q = deque()
    q.append((sx, sy, 0))
    vis[sx][sy] = True

    while q:
        x, y, d = q.popleft()
        if grid[x][y] == 'E':
            return d
        # 四向移动
        for dx, dy in dirs:
            nx, ny = x+dx, y+dy
            if 0 <= nx < m and 0 <= ny < n \
               and not vis[nx][ny] and grid[nx][ny] != '1':
                vis[nx][ny] = True
                q.append((nx, ny, d+1))
        # 跨越虫洞
        if grid[x][y] == '2':
            tx, ty = teleport[(x,y)]
            if not vis[tx][ty]:
                vis[tx][ty] = True
                q.append((tx, ty, d))
    return -1

# 读取输入并输出
if __name__ == '__main__':
    m, n = map(int, input().split())
    grid = [list(input().strip()) for _ in range(m)]
    print(shortest_path(grid))

#include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;

int main(){
    int m,n;
    cin >> m >> n;
    vector<string> g(m);
    for(int i=0;i<m;i++) cin >> g[i];
    vector<pii> holes;
    int sx=0, sy=0;
    for(int i=0;i<m;i++){
        for(int j=0;j<n;j++){
            if(g[i][j]=='S'){ sx=i; sy=j; }
            else if(g[i][j]=='2'){
                holes.emplace_back(i,j);
            }
        }
    }
    // 建立虫洞映射
    map<pii,pii> tel;
    for(int i=0;i<holes.size();i+=2){
        pii a = holes[i], b = holes[i+1];
        tel[a] = b;
        tel[b] = a;
    }
    vector<vector<bool>> vis(m, vector<bool>(n,false));
    queue<tuple<int,int,int>> q;
    q.emplace(sx, sy, 0);
    vis[sx][sy] = true;
    int ans = -1;
    int dx[4] = {-1,1,0,0}, dy[4] = {0,0,-1,1};
    while(!q.empty()){
        auto [x,y,d] = q.front(); q.pop();
        if(g[x][y]=='E'){
            ans = d;
            break;
        }
        // 四向
        for(int k=0;k<4;k++){
            int nx = x+dx[k], ny = y+dy[k];
            if(nx>=0 && nx<m && ny>=0 && ny<n
               && !vis[nx][ny] && g[nx][ny] != '1'){
                vis[nx][ny] = true;
                q.emplace(nx, ny, d+1);
            }
        }
        // 虫洞
        if(g[x][y]=='2'){
            pii to = tel[{x,y}];
            int tx = to.first, ty = to.second;
            if(!vis[tx][ty]){
                vis[tx][ty] = true;
                q.emplace(tx, ty, d);
            }
        }
    }
    cout << ans << "\n";
    return 0;
}

import java.util.*;

public class Main {
    static int m, n;
    static char[][] g;
    static boolean[][] vis;
    static int[][] dirs = {{-1,0},{1,0},{0,-1},{0,1}};
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        m = in.nextInt();
        n = in.nextInt();
        g = new char[m][n];
        int sx=0, sy=0;
        List<int[]> holes = new ArrayList<>();
        for (int i = 0; i < m; i++) {
            String line = in.next();
            for (int j = 0; j < n; j++) {
                g[i][j] = line.charAt(j);
                if (g[i][j] == 'S') {
                    sx = i; sy = j;
                } else if (g[i][j] == '2') {
                    holes.add(new int[]{i,j});
                }
            }
        }
        // 建立虫洞映射
        Map<String, String> tel = new HashMap<>();
        for (int i = 0; i < holes.size(); i += 2) {
            int[] a = holes.get(i), b = holes.get(i+1);
            tel.put(a[0]+","+a[1], b[0]+","+b[1]);
            tel.put(b[0]+","+b[1], a[0]+","+a[1]);
        }
        vis = new boolean[m][n];
        Queue<int[]> q = new LinkedList<>();
        q.offer(new int[]{sx, sy, 0});
        vis[sx][sy] = true;
        int ans = -1;
        while (!q.isEmpty()) {
            int[] cur = q.poll();
            int x = cur[0], y = cur[1], d = cur[2];
            if (g[x][y] == 'E') { ans = d; break; }
            // 四向
            for (int[] dir : dirs) {
                int nx = x + dir[0], ny = y + dir[1];
                if (nx>=0 && nx<m && ny>=0 && ny<n
                    && !vis[nx][ny] && g[nx][ny] != '1') {
                    vis[nx][ny] = true;
                    q.offer(new int[]{nx, ny, d+1});
                }
            }
            // 虫洞
            if (g[x][y] == '2') {
                String key = x+","+y;
                String[] p = tel.get(key).split(",");
                int tx = Integer.parseInt(p[0]), ty = Integer.parseInt(p[1]);
                if (!vis[tx][ty]) {
                    vis[tx][ty] = true;
                    q.offer(new int[]{tx, ty, d});
                }
            }
        }
        System.out.println(ans);
    }
}