#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <cmath>
#include <cassert>
#include <cstdio>

using namespace std;
using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector< int >;
using VVI = vector< vector< int > >;
using VS = vector< string >;
using SS = stringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< vector< T > >;
template < typename T = int > using LIM = numeric_limits< T >;

template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i ) << v[i]; } return s; }
template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; }
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); }

#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &&e : c )
#define ALL( c ) begin( c ), end( c )
#define AALL( a, t ) ( t* )a, ( t* )a + sizeof( a ) / sizeof( t )
#define DRANGE( c, p ) ( c ).begin(), ( c ).begin() + ( p ), ( c ).end()

#define SZ( v ) ( (int)( v ).size() )
#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )

template < typename T > inline bool chmin( T &a, const T &b ){ if ( b < a ) { a = b; return true; } return false; }
template < typename T > inline bool chmax( T &a, const T &b ){ if ( a < b ) { a = b; return true; } return false; }

#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define MP make_pair
#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

constexpr int INF = LIM<>::max() / 2;

constexpr int dy[][8] = {
	{ -2, -2, -1, -1, 1, 1, 2, 2 },
	{ -1, -1, 1, 1 }
};
constexpr int dx[][8] = {
	{ -1, 1, -2, 2, -2, 2, -1, 1 },
	{ -1, 1, -1, 1 }
};

int distances[ 512 ][ 512 ][2];

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );

	int H, W;
	cin >> H >> W;

	VS board( H );
	cin >> board;

	const auto inside = [&]( const int y, const int x ){ return 0 <= y && y < H && 0 <= x && x < W; };

	int sy, sx, gy, gx;
	REP( i, H )
	{
		REP( j, W )
		{
			if ( board[i][j] == 'S' )
			{
				sy = i;
				sx = j;
			}
			if ( board[i][j] == 'G' )
			{
				gy = i;
				gx = j;
			}
		}
	}

	using State = tuple< int , int, int >;

	fill( AALL( distances, int ), INF );
	distances[ sy ][ sx ][0] = 0;

	queue< State > que;
	que.EM( sy, sx, 0 );

	while ( !que.empty() )
	{
		const int y = get< 0 >( que.front() );
		const int x = get< 1 >( que.front() );
		const int p = get< 2 >( que.front() );
		que.pop();

		REP( d, p ? 4 : 8 )
		{
			const int ny = y + dy[p][d];
			const int nx = x + dx[p][d];

			if ( !inside( ny, nx ) )
			{
				continue;
			}

			const int np = board[ ny ][ nx ] == 'R' ? 1 - p : p;

			if ( distances[y][x][p] + 1 < distances[ ny ][ nx ][ np ] )
			{
				distances[ ny ][ nx ][ np ] = distances[y][x][p] + 1;
				que.EM( ny, nx, np );
			}
		}
	}

	const int res = min( distances[ gy ][ gx ][0], distances[ gy ][ gx ][1] );
	cout << ( res == INF ? -1 : res ) << endl;

	return 0;
}