#include <bits/stdc++.h>
using namespace std;
string g[10];
int x[10] = {1, 1, 1, 0, 0, 0, -1, -1, -1};
int y[10] = {1, 0, -1, 1, 0, -1, 1, 0, -1};
int ans = 0;
void dfs(int r, int c, int cur) {
  if (ans) return;
  if (cur > 6) {
    ans = 1;
    return;
  }
  for (int k = 0; k < 9; k++) {
    int rr = r + x[k];
    int cc = c + y[k];
    if (rr < 0 || rr >= 8 || cc < 0 || cc >= 8) continue;
    if (rr - cur >= 0 && rr - cur < 8 && g[rr - cur][cc] == 'S') continue;
    if (rr - cur - 1 >= 0 && rr - cur - 1 < 8 && g[rr - cur - 1][cc] == 'S')
      continue;
    dfs(rr, cc, cur + 1);
  }
}
int main() {
  for (int i = 0; i < 8; i++) cin >> g[i];
  dfs(7, 0, 0);
  if (ans)
    cout << "WIN\n";
  else
    cout << "LOSE\n";
  return 0;
}
