#include <bits/stdc++.h>
using namespace std;
char arr[8][8];
int no[8][8];
int dx[] = {0, -1, 0, 1, 1, 1, 0, -1, -1};
int dy[] = {0, -1, -1, -1, 0, 1, 1, 1, 0};
void dfs(int x, int y, int dep) {
  if (dep >= 7) {
    cout << "WIN" << endl;
    exit(0);
  }
  for (int i = 0; i < 9; i++) {
    int u = x + dx[i], v = y + dy[i];
    if (u < 0 || v < 0 || u > 7 || v > 7 || arr[u - dep][v] == 'S' ||
        (u - dep - 1 >= 0 && arr[u - dep - 1][v] == 'S'))
      continue;
    dfs(u, v, dep + 1);
  }
}
int main() {
  for (int i = 0; i < 8; i++) {
    for (int j = 0; j < 8; j++) {
      cin >> arr[i][j];
    }
  }
  dfs(7, 0, 0);
  cout << "LOSE" << endl;
  return 0;
}
