#include <bits/stdc++.h>
using namespace std;
const int N = 8;
bool s[8][8][80], used[8][8][80];
struct stru {
  int x, y, t;
};
queue<stru> q;
int dx[] = {0, 0, 1, -1, 1, 1, -1, -1, 0},
    dy[] = {1, -1, 0, 0, 1, -1, -1, 1, 0};
bool check(int x, int y) { return x >= 0 && y >= 0 && x < 8 && y < 8; }
void bfs() {
  while (!q.empty()) {
    int x = q.front().x, y = q.front().y, t = q.front().t;
    q.pop();
    if (x == 0 && y == 7) {
      cout << "WIN";
      exit(0);
    }
    for (int i = 0; i < 9; ++i) {
      int nx = x + dx[i], ny = y + dy[i];
      if (check(nx, ny) && !s[nx][ny][t] && !s[nx][ny][t + 1] &&
          !used[nx][ny][t + 2]) {
        used[nx][ny][t + 2] = 1;
        q.push({nx, ny, t + 2});
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  for (int i = 0; i < 8; ++i) {
    for (int j = 0; j < 8; ++j) {
      char ch;
      cin >> ch;
      if (ch == 'S') {
        int time = 0;
        for (int k = i; k < 8; k += time % 2) {
          s[k][j][time] = 1;
          time++;
        }
      }
    }
  }
  q.push({7, 0, 0});
  bfs();
  cout << "LOSE";
}
