#include <bits/stdc++.h>
using namespace std;
const int N = 8;
const int dx[9] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
const int dy[9] = {-1, 0, 1, -1, 0, 1, -1, 0, 1};
string a[N];
int v[105][N][N], f[105][N][N];
int main() {
  for (int i = 0; i < N; ++i) cin >> a[i];
  memset(v, 0, sizeof(v));
  for (int i = 0; i < N; ++i)
    for (int j = 0; j < N; ++j)
      if (a[i][j] == 'S')
        for (int k = i + 1; k <= N; ++k)
          v[k - i][k][j] = v[k - i][k - 1][j] = 1;
  memset(f, 0, sizeof(f));
  f[0][7][0] = 1;
  for (int t = 1; t <= 100; ++t)
    for (int x = 0; x < N; ++x)
      for (int y = 0; y < N; ++y)
        if (f[t - 1][x][y])
          for (int dire = 0; dire < 9; ++dire) {
            int xx = x + dx[dire];
            int yy = y + dy[dire];
            if (xx < 0 || xx >= N) continue;
            if (yy < 0 || yy >= N) continue;
            if (v[t][xx][yy]) continue;
            f[t][xx][yy] = 1;
          }
  bool flag = 0;
  for (int t = 1; t <= 100; ++t) flag |= f[t][0][7];
  if (flag)
    cout << "WIN";
  else
    cout << "LOSE";
  cout << endl;
  return 0;
}
