#include <bits/stdc++.h>
using namespace std;
const int N = 10 + 5, M = 1e6 + 5, OO = 0x3f3f3f3f;
char grid[N][N];
int vis[N][N][27], vid, n, m;
int dx[] = {0, -1, 0, 1, 1, -1, -1, 1, 0};
int dy[] = {-1, 0, 1, 0, 1, 1, -1, -1, 0};
bool valid(int x, int y) { return (x > -1 && x < 8 && y > -1 && y < 8); }
int DFS(int x = 7, int y = 0, int d = 0) {
  if (d >= 20 || vis[x][y][d]) return 0;
  vis[x][y][d] = 1;
  if (x - d >= 0 && grid[x - d][y] == 'S') return 0;
  if (x == 0 && y == 7) return 1;
  for (int k = 0; k < 9; ++k) {
    int nx = x + dx[k];
    int ny = y + dy[k];
    if (valid(nx, ny)) {
      if (nx - d >= 0 && grid[nx - d][ny] == 'S') continue;
      if (DFS(nx, ny, d + 1)) return 1;
    }
  }
  return 0;
}
int main() {
  for (int i = 0; i < 8; ++i) scanf(" %s", grid[i]);
  puts(DFS() ? "WIN" : "LOSE");
}
