#include <bits/stdc++.h>
using namespace std;
int a[10][10];
int b[9] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
int c[9] = {-1, 0, 1, -1, 0, 1, -1, 0, 1};
bool r = false;
void dfs(int x, int y, int s) {
  if (s == 8) {
    r = true;
    return;
  }
  for (int i = 0; i < 9; i++) {
    int ex = x + b[i], ey = y + c[i];
    if (ex > 8 || ey > 8 || ex < 1 || ey < 1 || a[ex - s - 1][ey] ||
        a[ex - s][ey])
      continue;
    dfs(ex, ey, s + 1);
  }
}
int main() {
  int i = 0, j = 0;
  char d;
  for (i = 1; i <= 8; i++)
    for (j = 1; j <= 8; j++) {
      cin >> d;
      if (d == '.' || r == 'M' || r == 'A') a[i][j] = 0;
      if (d == 'S') a[i][j] = 1;
    }
  dfs(8, 1, 0);
  if (r)
    cout << "WIN";
  else
    cout << "LOSE";
  return 0;
}
