#include <bits/stdc++.h>
using namespace std;
const int N = 3000;
int fbd[10][8][8];
const int dx[] = {-1, -1, -1, 1, 1, 1, 0, 0, 0};
const int dy[] = {-1, 1, 0, -1, 1, 0, -1, 1, 0};
int dfs(int x, int y, int dep) {
  if (dep >= 8) return 1;
  for (int(i) = (0); (i) <= (8); ++(i)) {
    int nx = x + dx[i], ny = y + dy[i];
    if (nx < 0 || nx >= 8 || ny < 0 || ny >= 8) continue;
    if (fbd[dep + 1][nx][ny] || fbd[dep][nx][ny]) continue;
    if (dfs(nx, ny, dep + 1)) return 1;
  }
  return 0;
}
char mm[10][10];
int main() {
  for (int(i) = (0); (i) <= (7); ++(i)) scanf("%s", mm[i]);
  for (int(i) = (0); (i) <= (7); ++(i))
    for (int(j) = (0); (j) <= (7); ++(j))
      if (mm[i][j] == 'S') {
        int x = i, y = j, _t = 0;
        while (x < 8) {
          fbd[_t][x][y] = 1;
          ++_t;
          ++x;
        }
      }
  if (dfs(7, 0, 0))
    cout << "WIN";
  else
    cout << "LOSE";
  return 0;
}
