#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;
char a[10][10][10];
struct P {
  int x, y, step;
  P() {}
  P(int x, int y, int step) : x(x), y(y), step(step) {}
};
bool vis[10][10];
bool bfs() {
  queue<P> q;
  memset(vis, false, sizeof vis);
  vis[8][1] = true;
  q.push(P(8, 1, 0));
  while (q.size()) {
    P cur = q.front(), nxt;
    q.pop();
    if (cur.step > 8 || cur.x == 1 && cur.y == 8) return true;
    for (int i = -1; i <= 1; ++i) {
      for (int j = -1; j <= 1; ++j) {
        int nx = cur.x + i, ny = cur.y + j;
        if (nx < 1 || nx > 8 || ny < 1 || ny > 8) continue;
        if (cur.step <= 8 && a[cur.step][nx][ny] == 'S') continue;
        if (cur.step <= 7 && a[cur.step + 1][nx][ny] == 'S') continue;
        q.push(P(nx, ny, cur.step + 1));
      }
    }
  }
  return false;
}
int main() {
  ios_base::sync_with_stdio(0);
  while (cin >> (a[0][1] + 1)) {
    for (int i = 2; i <= 8; ++i) cin >> (a[0][i] + 1);
    for (int t = 1; t <= 8; ++t) {
      for (int i = 8; i; --i) {
        for (int j = 1; j <= 8; ++j) {
          a[t][i][j] = a[t - 1][i][j];
          if (a[t - 1][i][j] == 'S') {
            a[t][i][j] = '.';
            if (i + 1 <= 8) a[t][i + 1][j] = 'S';
          }
        }
      }
    }
    cout << (bfs() ? "WIN" : "LOSE") << '\n';
  }
  return 0;
}
