#include <bits/stdc++.h>
using namespace std;
const int maxn = 15, maxt = 25;
bool mark1[maxn][maxn][maxt], mark2[maxn][maxn][maxt];
char c;
int s1[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
int s2[] = {-1, 0, 1, -1, 0, 1, -1, 0, 1};
void dfs(int y1, int y2, int y3) {
  mark2[y1][y2][y3] = true;
  if (y3 < 24) {
    for (int i = 0; i < 9; i++) {
      if (!mark1[y1 + s1[i]][y2 + s2[i]][y3 + 1] &&
          !mark1[y1 + s1[i]][y2 + s2[i]][y3] &&
          !mark2[y1 + s1[i]][y2 + s2[i]][y3 + 1]) {
        dfs((y1 + s1[i]), (y2 + s2[i]), (y3 + 1));
      }
    }
  }
}
int main() {
  for (int i = 8; i >= 1; i--) {
    for (int j = 1; j <= 8; j++) {
      cin >> c;
      if (c == 'S') {
        for (int k = 0; k < i; k++) {
          mark1[i - k][j][k] = true;
        }
      }
    }
  }
  for (int i = 0; i <= 9; i++) {
    for (int j = 0; j < maxt; j++) {
      mark1[0][i][j] = true;
      mark1[9][i][j] = true;
      mark1[i][0][j] = true;
      mark1[i][9][j] = true;
    }
  }
  dfs(1, 1, 0);
  for (int i = 0; i <= 24; i++) {
    if (mark2[8][8][i]) {
      cout << "WIN" << endl;
      return 0;
    }
  }
  cout << "LOSE" << endl;
  return 0;
}
