#include <bits/stdc++.h>
using namespace std;
int n, m;
bool vis[8][8];
char x[8][8];
pair<int, int> dir[] = {{1, 0},  {-1, 0},  {0, 1},  {0, -1}, {1, 1},
                        {1, -1}, {-1, -1}, {-1, 1}, {0, 0}};
void dis(int q, int i) {
  if (x[q][i] == 'S') dis(q + 1, i);
  if (q < 8) {
    x[q][i] = 'z';
    vis[q][i] = 0;
  }
}
void bfs() {
  bool flag = true;
  while (flag) {
    if (vis[0][7]) {
      break;
    }
    flag = false;
    for (int q = 0; q < 8; q++)
      for (int i = 0; i < 8; i++) {
        if (x[q][i] == 'M') {
          flag = true;
          for (int c = 0; c < 9; c++) {
            int xy = dir[c].first;
            int y = dir[c].second;
            if (!(q + xy < 0 || i + y < 0 || q + xy >= 8 || i + y >= 8)) {
              if (x[q + xy][i + y] != 'S' && x[q + xy][i + y] != 'z') {
                vis[q + xy][i + y] = 1;
              }
            }
          }
        }
      }
    for (int q = 0; q < 8; q++)
      for (int i = 0; i < 8; i++) {
        if (x[q][i] == 'S') {
          x[q][i] = '.';
          dis(q + 1, i);
          vis[q + 1][i] = 0;
        }
      }
    for (int q = 0; q < 8; q++)
      for (int i = 0; i < 8; i++) {
        if (vis[q][i]) x[q][i] = 'M';
        if (x[q][i] == 'z') x[q][i] = 'S';
      }
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  for (int q = 0; q < 8; q++)
    for (int i = 0; i < 8; i++) {
      cin >> x[q][i];
    }
  bfs();
  if (vis[0][7])
    cout << "WIN";
  else
    cout << "LOSE";
  return 0;
}
