#include <bits/stdc++.h>
using namespace std;
char Map[9][9];
int dir[9][2] = {0, 0, 1, 0, -1, 0, 0, 1, 0, -1, 1, 1, -1, -1, 1, -1, -1, 1};
int flag = 0;
void dfs(int x, int y, int t) {
  if (t >= 8) {
    flag = 1;
    return;
  }
  for (int i = 0; i < 9; i++) {
    int nx = x + dir[i][0];
    int ny = y + dir[i][1];
    if (nx < 1 || nx > 8 || ny < 1 || ny > 8) continue;
    if (nx - t >= 1 && Map[nx - t][ny] == 'S') continue;
    if (nx - t - 1 >= 1 && Map[nx - t - 1][ny] == 'S') continue;
    dfs(nx, ny, t + 1);
  }
}
int main() {
  flag = 0;
  for (int i = 1; i <= 8; i++) {
    for (int j = 1; j <= 8; j++) {
      cin >> Map[i][j];
    }
  }
  dfs(8, 1, 0);
  if (flag)
    cout << "WIN" << endl;
  else
    cout << "LOSE" << endl;
  return 0;
}
