#include <bits/stdc++.h>
using namespace std;
bool vis[8][8][200];
bool win = false;
string rows[8];
void dfs(int r, int c, int step) {
  if (step > 199) return;
  if (vis[r][c][step]) return;
  vis[r][c][step] = true;
  if (r == 0 && c == 7) {
    win = true;
    return;
  }
  for (int i = 0; i < 8; i++) {
    if (rows[i][c] == 'S' && i + step == r) return;
  }
  for (int i = 0; i < 8; i++) {
    if (rows[i][c] == 'S' && i + step - 1 == r) return;
  }
  dfs(r, c, step + 1);
  if (r > 0) dfs(r - 1, c, step + 1);
  if (r < 7) dfs(r + 1, c, step + 1);
  if (c > 0) dfs(r, c - 1, step + 1);
  if (c < 7) dfs(r, c + 1, step + 1);
  if (r > 0 && c > 0) dfs(r - 1, c - 1, step + 1);
  if (r < 7 && c < 7) dfs(r + 1, c + 1, step + 1);
  if (r > 0 && c < 7) dfs(r - 1, c + 1, step + 1);
  if (r < 7 && c > 0) dfs(r + 1, c - 1, step + 1);
}
int main() {
  for (int i = 0; i < 8; i++) cin >> rows[i];
  memset(vis, 0, sizeof(vis));
  dfs(7, 0, 0);
  if (win)
    cout << "WIN" << endl;
  else
    cout << "LOSE" << endl;
}
