#include <bits/stdc++.h>
using namespace std;
string str[8];
int short1[100][100];
int dx[] = {-1, -1, 0, 1, 1, 1, 0, -1, 0};
int dy[] = {0, 1, 1, 1, 0, -1, -1, -1, 0};
queue<pair<pair<int, int>, int> > Q;
int main() {
  for (int i = 0; i < 8; ++i) cin >> str[i];
  memset(short1, 0x3f, sizeof(short1));
  short1[7][0] = 0;
  Q.push(make_pair(make_pair(7, 0), 0));
  while (!Q.empty()) {
    pair<pair<int, int>, int> top = Q.front();
    Q.pop();
    int x = top.first.first, y = top.first.second, t = top.second;
    for (int i = 0; i < 9; ++i) {
      int nextX = x + dx[i], nextY = y + dy[i];
      int nextT = t + 1;
      if (nextX < 0 || nextX > 7 || nextY < 0 || nextY > 7) continue;
      if (nextX >= nextT)
        if (str[nextX - nextT][nextY] == 'S') continue;
      if (nextX >= nextT - 1) {
        if (str[nextX - nextT + 1][nextY] == 'S') continue;
      }
      Q.push(make_pair(make_pair(nextX, nextY), nextT));
      if (nextX == 0 && nextY == 7) {
        puts("WIN");
        return 0;
      }
    }
  }
  puts("LOSE");
  return 0;
}
