#include <bits/stdc++.h>
using namespace std;
char C[9][9];
int W[9][9][100];
void bfs(int i, int j, int t) {
  if (j == 0 || i == 0 || j > 8 || i > 8) return;
  if (i + 1 > t)
    if (C[i - t + 1][j] == 'S') return;
  W[i][j][t] = t;
  if (t > 8) {
    cout << "WIN";
    exit(0);
  }
  for (int x = -1; x <= 1; x++)
    for (int y = -1; y <= 1; y++)
      if (t + 1 < i + x) {
        if (C[i + x - t - 1][j + y] != 'S') bfs(i + x, j + y, t + 1);
      } else
        bfs(i + x, j + y, t + 1);
}
int main() {
  for (int i = 1; i <= 8; i++)
    for (int j = 1; j <= 8; j++) cin >> C[i][j];
  bfs(8, 1, 0);
  cout << "LOSE";
}
