#include <bits/stdc++.h>
using namespace std;
const int n = 8;
string m[n];
int u[8][8][64];
const int dx[8] = {-1, 0, 1, 0, 1, 1, -1, -1};
const int dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};
bool bound(int x, int y) { return x >= 0 && y >= 0 && x < n && y < n; }
int dfs(int x, int y, int time) {
  if (time >= 64) return 0;
  if (x == 0 && y == n - 1) return 1;
  u[x][y][time] = 1;
  for (int i = 0; i < 8; ++i) {
    int tox = x + dx[i];
    int toy = y + dy[i];
    if (bound(tox, toy) && !u[tox][toy][time] &&
        (time >= 8 || !u[tox][toy][time + 1]))
      if (dfs(tox, toy, time + 1)) return 1;
  }
  if (!u[x][y][time + 1] && dfs(x, y, time + 1)) return 1;
  return 0;
}
int main() {
  memset(u, 0, sizeof(u));
  for (int i = 0; i < n; ++i) cin >> m[i];
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < n; ++j)
      if (m[i][j] == 'S')
        for (int k = 0; k + i < n; ++k) u[k + i][j][k] = 1;
  if (dfs(n - 1, 0, 0))
    cout << "WIN" << endl;
  else
    cout << "LOSE" << endl;
  return 0;
}
