#include <bits/stdc++.h>
using namespace std;
string n = ".......A", x, y;
vector<int> moves[65];
map<string, bool> visited;
int bmoves[] = {0, 1, -1, 8, -8, 9, -9, 7, -7};
int f = 56, t = 7;
bool F = 0;
void calc() {
  int a[] = {0, 1, 8, 9};
  moves[0] = vector<int>(a, a + sizeof(a) / sizeof(a[0]));
  int b[] = {0, 1, -1, 8, 9, 7};
  for (int i = 1; i <= 6; i++)
    moves[i] = vector<int>(b, b + sizeof(b) / sizeof(b[0]));
  int c[] = {0, -1, 8, 7};
  moves[7] = vector<int>(c, c + sizeof(c) / sizeof(c[0]));
  int d[] = {0, -8, 1, 8, 9, -7};
  for (int i = 8; i < 56; i += 8)
    moves[i] = vector<int>(d, d + sizeof(d) / sizeof(d[0]));
  int e[] = {1, -8, -7, 0};
  moves[56] = vector<int>(e, e + sizeof(e) / sizeof(e[0]));
  int g[] = {0, -1, 8, -8, 7, -9};
  for (int i = 15; i < 64; i += 8)
    moves[i] = vector<int>(g, g + sizeof(g) / sizeof(g[0]));
  int h[] = {0, -1, -8, -9};
  moves[64] = vector<int>(h, h + sizeof(h) / sizeof(h[0]));
  int p[] = {1, -1, -8, -7, -9};
  for (int i = 57; i < 64; i++)
    moves[i] = vector<int>(p, p + sizeof(p) / sizeof(p[0]));
}
void dfs(string s, int from) {
  visited[s] = 1;
  if (y != s) {
    if (from - 8 >= 0) {
      if (s[from - 8] == 'S') return;
      s[from - 8] = 'M';
      s[from] = '.';
      s[7] = '.';
      s = n + s.substr(0, 56);
    }
  }
  int nxt;
  if (moves[from].size() == 0) {
    for (int i = 0; i < 9; i++) {
      nxt = from + bmoves[i];
      if (s[nxt] == 'S') continue;
      if (s[nxt] == 'A') {
        F = 1;
        return;
      }
      s[nxt] = 'M';
      s[from] = '.';
      if (!visited[s]) dfs(s, nxt);
      s[from] = 'M';
      s[nxt] = '.';
    }
  } else {
    for (int i = 0; i < moves[from].size(); i++) {
      nxt = from + moves[from][i];
      if (s[nxt] == 'S') continue;
      if (s[nxt] == 'A') {
        F = 1;
        return;
      }
      s[nxt] = 'M';
      s[from] = '.';
      if (!visited[s]) dfs(s, nxt);
      s[from] = 'M';
      s[nxt] = '.';
    }
  }
}
int main() {
  for (int i = 0; i < 8; i++) {
    cin >> x;
    y += x;
  }
  calc();
  dfs(y, f);
  if (F)
    puts("WIN");
  else
    puts("LOSE");
  return 0;
}
