#include <bits/stdc++.h>
using namespace std;
int mp[12][12][12];
int ans;
char s[12][12];
int dx[] = {0, 1, 0, -1, 1, 1, -1, -1}, dy[] = {1, 0, -1, 0, 1, -1, 1, -1};
int f;
void dfs(int x, int y, int t) {
  if (f) return;
  if (mp[t][x][y]) return;
  if (t >= 8) {
    f = 1;
    return;
  }
  for (int i = 0; i < 8; i++) {
    int t1 = x + dx[i], t2 = y + dy[i];
    if (mp[t][t1][t2] || t1 < 1 || t2 < 1 || t1 > 8 || t2 > 8) continue;
    dfs(t1, t2, t + 1);
  }
  if (!mp[t + 1][x][y]) dfs(x, y, t + 1);
  return;
}
int main() {
  for (int i = 1; i <= 8; i++) {
    scanf("%s", s[i] + 1);
    for (int j = 1; j <= 8; j++) {
      if (s[i][j] == 'S')
        mp[0][i][j] = 1;
      else
        mp[0][i][j] = 0;
    }
  }
  for (int t = 1; t <= 8; t++) {
    for (int i = 1; i <= 8; i++) {
      for (int j = 1; j <= 8; j++) {
        if (mp[t - 1][i - 1][j])
          mp[t][i][j] = 1;
        else
          mp[t][i][j] = 0;
      }
    }
  }
  dfs(8, 1, 0);
  if (f) {
    puts("WIN");
    return 0;
  } else {
    puts("LOSE");
    return 0;
  }
  return 0;
}
