#include <bits/stdc++.h>
int used[300];
int r[300];
int curr = 0;
using namespace std;
int a[503][10];
int need = 0;
void down() {
  for (int i = 500; i >= 2; i--) {
    for (int j = 2; j <= 9; j++) {
      if (a[i][j] == 102) {
        a[i][j] = 0;
        a[i + 1][j] = 102;
      }
    }
  }
}
void up() {
  for (int i = 2; i <= 500; i++) {
    for (int j = 2; j <= 9; j++) {
      if (a[i][j] == 102) {
        a[i][j] = 0;
        a[i - 1][j] = 102;
      }
    }
  }
}
void dfs(int i, int j) {
  if (!(2 <= i && i <= 9 && 2 <= j && j <= 9)) {
    return;
  }
  if (need) down();
  need = 1;
  if (i == 2 && j == 9) {
    cout << "WIN";
    exit(0);
  }
  if (a[i - 1][j + 1] != 102 && a[i - 2][j + 1] != 102) {
    dfs(i - 1, j + 1);
  }
  if (a[i - 1][j] != 102 && a[i - 2][j] != 102) {
    dfs(i - 1, j);
  }
  if (a[i][j + 1] != 102 && a[i - 1][j + 1] != 102) {
    dfs(i, j + 1);
  }
  if (a[i + 1][j + 1] != 102 && a[i][j + 1] != 102) {
    dfs(i + 1, j + 1);
  }
  if (a[i - 1][j - 1] != 102 && a[i - 2][j - 1] != 102) {
    dfs(i - 1, j - 1);
  }
  if (a[i][j - 1] != 102 && a[i - 1][j - 1] != 102) {
    dfs(i, j - 1);
  }
  if (a[i + 1][j] != 102 && a[i][j] != 102) {
    dfs(i + 1, j);
  }
  if (a[i + 1][j - 1] != 102 && a[i][j - 1] != 102) {
    dfs(i + 1, j - 1);
  }
  if (a[i - 1][j] != 102) {
    dfs(i, j);
    down();
  }
  up();
}
int main() {
  char s[20];
  for (int i = 0; i < 8; i++) {
    cin >> s;
    for (int j = 0; j < 8; j++) {
      if (s[j] == 'M') a[i + 2][j + 2] = 100;
      if (s[j] == 'A') a[i + 2][j + 2] = 101;
      if (s[j] == 'S') a[i + 2][j + 2] = 102;
      if (s[j] == '.') a[i + 2][j + 2] = 0;
    }
  }
  dfs(9, 2);
  cout << "LOSE";
  return 0;
}
