#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_DEPRECATE

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <limits>
#include <ctime>
#include <cassert>
#include <map>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <stack>
#include <queue>
#include <numeric>
#include <iterator>
#include <bitset>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;

#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)(c).size())
#define ten(x) ((int)1e##x)

template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
template<typename ...> static inline void putchar_unlocked(int c) { putchar(c); }
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }
template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }
template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }
template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V & w) { reader(x); reader(y); reader(z); reader(w); }
void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }
void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
template<class T> void writerLn(T x) { writer(x, '\n'); }
template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }
template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }
template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }

ll mod_pow(ll a, ll n, ll mod) { ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; }
template<class T> T mod_inv(T a, T m) { T x, y; extgcd(a, m, x, y); return (m + x % m) % m; }
template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }

int r, c;
char t[30][31];
int memo[30][30];

int d[] = { 0, 1, 0, -1, 0 };

bool in(int x, int y) {
	return 0 <= x && x < r && 0 <= y && y < c;
}

int main() {
	reader(r, c);
	FOR(i, r) reader(t[i]);
	Pii s, g;
	FOR(i, r) FOR(j, c) {
		if (t[i][j] == 'S') s = Pii(i, j);
		else if (t[i][j] == 'G') g = Pii(i, j);
	}
	memset(memo, 0x0f, sizeof(memo));

	typedef pair<int, Pii> P;
	priority_queue<P, vector<P>, greater<P>> pq;
	pq.push(P(0, s));
	memo[s.first][s.second] = 0;
	while (!pq.empty()) {
		int cost; Pii cur; tie(cost, cur) = pq.top(); pq.pop();
		if (cost > memo[cur.first][cur.second]) continue;
		FOR(dir, 4) {
			int nx = cur.first + d[dir], ny = cur.second + d[dir + 1];
			if (!in(nx, ny)) continue;
			if (t[nx][ny] != 'x' && t[nx][ny] != '#') {
				int ncost = cost;
				if (t[nx][ny] == 'o') ncost += 1;
				else ncost += 2;
				if (memo[nx][ny] > ncost) {
					memo[nx][ny] = ncost;
					pq.push(P(ncost, Pii(nx, ny)));
				}
			}

			for (int len = 1; len <= 3; len++) {
				int nx = cur.first + d[dir] * len, ny = cur.second + d[dir + 1] * len;
				int ncost = cost + 2 + len;
				if (!in(nx, ny)) break;
				if (t[nx][ny] == '#') break;
				if (memo[nx][ny] > ncost) {
					memo[nx][ny] = ncost;
					pq.push(P(ncost, Pii(nx, ny)));
				}
			}
		}
	}
	
	int ans = memo[g.first][g.second];
	writerLn(ans);

	return 0;
}

Measured memory_bytes: 1108