#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
const int dx[] = {0, 1, 1, 0, -1, -1, -1, 0, 1};
const int dy[] = {0, 0, 1, 1, 1, 0, -1, -1, -1};
char table[32][8][8];
bool find(int time, int row, int col) {
  if (row == 0 && col == 7) return true;
  if (time >= 16) return true;
  if (table[time][row][col] == 'S') return false;
  bool r = false;
  for (int i = 0; i < 9; i++)
    if (row + dx[i] >= 0 && row + dx[i] <= 7 && col + dy[i] >= 0 &&
        col + dy[i] <= 7 && table[time][row + dx[i]][col + dy[i]] != 'S')
      r = r || find(time + 1, row + dx[i], col + dy[i]);
  return r;
}
void initTable() {
  char s[16];
  for (int i = 0; i < 8; i++) {
    cin >> s;
    for (int j = 0; j < 8; j++) table[0][i][j] = s[j];
  }
  for (int t = 1; t < 32; t++) {
    for (int i = 0; i < 8; i++) table[t][0][i] = table[t - 1][0][i];
    for (int i = 1; i < 8; i++) {
      for (int j = 0; j < 8; j++)
        table[t][i][j] = (table[t - 1][i - 1][j] == 'S') ? 'S' : '.';
    }
  }
}
int main() {
  initTable();
  bool r = find(0, 7, 0);
  if (r)
    cout << "WIN" << endl;
  else
    cout << "LOSE" << endl;
  return (0);
}
