#include <bits/stdc++.h>
using namespace std;
string org[10];
char curr[10][10];
int dx[9] = {1, 1, 1, -1, -1, -1, 0, 0, 0};
int dy[9] = {0, 1, -1, 0, 1, -1, 1, -1, 0};
bool in(int x, int y, int i) {
  return (x + dx[i] >= 0 && x + dx[i] < 8 && y + dy[i] >= 0 && y + dy[i] < 8);
}
void move(int steps) {
  for (int i = 0; i < 8; ++i)
    for (int j = 0; j < 8; ++j) curr[i][j] = '.';
  for (int i = 7; i >= 0; --i) {
    for (int j = 0; j < 8; ++j) {
      if (org[i][j] == 'S') {
        if (i + steps >= 8)
          continue;
        else {
          curr[i + steps][j] = 'S';
        }
      }
    }
  }
}
bool dfs(int x, int y, int step) {
  if (step == 8) return true;
  move(step);
  if (curr[x][y] == 'S') {
    return false;
  }
  bool ret = false;
  for (int i = 0; i < 9; ++i) {
    move(step);
    if (in(x, y, i) && curr[x + dx[i]][y + dy[i]] != 'S') {
      ret = ret || dfs(x + dx[i], y + dy[i], step + 1);
    }
  }
  return ret;
}
int main() {
  for (int i = 0; i < 8; ++i) cin >> org[i];
  for (int i = 0; i < 8; ++i)
    for (int j = 0; j < 8; ++j) curr[i][j] = '.';
  if (dfs(7, 0, 0))
    cout << "WIN" << endl;
  else
    cout << "LOSE" << endl;
}
