#include <bits/stdc++.h>
using namespace std;
const int N = 8;
int statue[N][N][N];
char mapa[N][N];
int dx[] = {1, 1, 1, 0, -1, 1, -1, 0, 0};
int dy[] = {1, 0, -1, 1, -1, 0, 1, 1, 0};
int ans = 0;
void dfs(int first, int second, int deep) {
  if (deep >= N) {
    ans = 1;
    return;
  }
  if (first >= N || first < 0 || second < 0 || second >= N) return;
  if (statue[first][second][deep]) return;
  if (first == 0 && second == 7) {
    ans = 1;
    return;
  }
  for (int i = 0; i < 9; ++i)
    if (first + dx[i] < N && first + dx[i] >= 0 && second + dy[i] < N &&
        second + dy[i] >= 0)
      if (statue[first + dx[i]][second + dy[i]][deep] != 1)
        dfs(first + dx[i], second + dy[i], deep + 1);
}
int main() {
  for (int i = 0; i < N; ++i) gets(mapa[i]);
  for (int i = 0; i < N; ++i)
    for (int j = 0; j < N; ++j)
      if (mapa[i][j] == 'S') statue[i][j][0] = 1;
  for (int i = 0; i < N - 1; ++i)
    for (int j = 0; j < N; ++j)
      for (int k = 0; k < N; ++k)
        if (statue[j][k][i])
          if (j + 1 < N) statue[j + 1][k][i + 1] = 1;
  dfs(7, 0, 0);
  printf("%s", ans ? "WIN" : "LOSE");
  return 0;
}
