#include <bits/stdc++.h>
using namespace std;
char a[8][8];
vector<int> vec[8][8];
bool isPossible = false;
void bfs(int i, int j, int a) {
  if (a == 9) {
    isPossible = true;
    return;
  }
  bool temp = true;
  for (int l = 0; l < vec[i][j].size(); l++)
    if (vec[i][j][l] == a + 1 || vec[i][j][l] == a) {
      temp = false;
      break;
    }
  if (temp) bfs(i, j, a + 1);
  if (i + 1 < 8) {
    bool temp = true;
    for (int l = 0; l < vec[i + 1][j].size(); l++)
      if (vec[i + 1][j][l] == a + 1 || vec[i + 1][j][l] == a) {
        temp = false;
        break;
      }
    if (temp) bfs(i + 1, j, a + 1);
    temp = true;
    for (int l = 0; l < vec[i + 1][j - 1].size(); l++)
      if (vec[i + 1][j - 1][l] == a + 1 || vec[i + 1][j - 1][l] == a) {
        temp = false;
        break;
      }
    if (j - 1 >= 0)
      if (temp) bfs(i + 1, j - 1, a + 1);
    temp = true;
    for (int l = 0; l < vec[i + 1][j + 1].size(); l++)
      if (vec[i + 1][j + 1][l] == a + 1 || vec[i + 1][j + 1][l] == a) {
        temp = false;
        break;
      }
    if (j + 1 < 8)
      if (temp) bfs(i + 1, j + 1, a + 1);
  }
  if (i - 1 >= 0) {
    bool temp = true;
    for (int l = 0; l < vec[i - 1][j].size(); l++)
      if (vec[i - 1][j][l] == a + 1 || vec[i - 1][j][l] == a) {
        temp = false;
        break;
      }
    if (temp) bfs(i - 1, j, a + 1);
    temp = true;
    for (int l = 0; l < vec[i - 1][j - 1].size(); l++)
      if (vec[i - 1][j - 1][l] == a + 1 || vec[i - 1][j - 1][l] == a) {
        temp = false;
        break;
      }
    if (j - 1 >= 0)
      if (temp) bfs(i - 1, j - 1, a + 1);
    temp = true;
    for (int l = 0; l < vec[i - 1][j + 1].size(); l++)
      if (vec[i - 1][j + 1][l] == a + 1 || vec[i - 1][j + 1][l] == a) {
        temp = false;
        break;
      }
    if (j + 1 < 8)
      if (temp) bfs(i - 1, j + 1, a + 1);
  }
  if (j - 1 >= 0) {
    bool temp = true;
    for (int l = 0; l < vec[i][j - 1].size(); l++)
      if (vec[i][j - 1][l] == a + 1 || vec[i][j - 1][l] == a) {
        temp = false;
        break;
      }
    if (temp) bfs(i, j - 1, a + 1);
  }
  if (j + 1 < 8) {
    bool temp = true;
    for (int l = 0; l < vec[i][j + 1].size(); l++)
      if (vec[i][j + 1][l] == a + 1 || vec[i][j + 1][l] == a) {
        temp = false;
        break;
      }
    if (temp) bfs(i, j + 1, a + 1);
  }
  return;
}
int main() {
  for (int i = 0; i < 8; i++)
    for (int j = 0; j < 8; j++) {
      char temp;
      cin >> temp;
      if (temp == 'S') {
        int tt = 1;
        for (int l = i; l < 8; l++) {
          vec[l][j].push_back(tt);
          tt++;
        }
      }
    }
  bfs(7, 0, 1);
  if (isPossible)
    cout << "WIN";
  else
    cout << "LOSE";
  return 0;
}
