#include <bits/stdc++.h>
using namespace std;
int movi[] = {1, 0, -1, 0, -1, -1, 1, 1, 0};
int movj[] = {0, 1, 0, -1, -1, 1, -1, 1, 0};
string board[8];
bool mem[8][8][20];
bool win;
void dfs(int i, int j, int t) {
  if (i == 0 && j == 7) {
    win = true;
    return;
  }
  if (t >= 20) return;
  for (int k = 0; k < 9 && !win; k++) {
    int ni = i + movi[k], nj = j + movj[k];
    if (0 <= ni && ni < 8 && 0 <= nj && nj < 8 && mem[ni][nj][t + 1] &&
        mem[ni][nj][t])
      dfs(ni, nj, t + 1);
  }
  return;
}
int main() {
  for (int i = 0; i < 8; i++) cin >> board[i];
  for (int i = (0); i < (8); i++)
    for (int j = (0); j < (8); j++)
      for (int k = (0); k < (20); k++) mem[i][j][k] = 1;
  for (int i = (0); i < (8); i++)
    for (int j = (0); j < (8); j++)
      if (board[i][j] == 'S') {
        for (int k = 0; k < 8 - i; k++) mem[i + k][j][k] = 0;
      }
  win = false;
  dfs(7, 0, 0);
  if (win)
    cout << "WIN" << endl;
  else
    cout << "LOSE" << endl;
  return 0;
}
