#include <bits/stdc++.h>
using namespace std;
int dp[10][10][10];
int main() {
  for (int i = 0; i < 10; i++)
    for (int j = 0; j < 10; j++)
      for (int k = 0; k < 10; k++) dp[i][j][k] = -1;
  char in[15];
  for (int i = 0; i < 8; i++) {
    scanf(" %s", in);
    for (int j = 0; j < 8; j++)
      if (in[j] == 'S') dp[7 - i][j][0] = 0;
  }
  dp[0][0][0] = 1;
  for (int k = 1; k <= 8; k++) {
    for (int i = 0; i < 8; i++) {
      for (int j = 0; j < 8; j++) {
        if (i < 7 && dp[i + 1][j][k - 1] == 0) {
          dp[i][j][k] = 0;
        } else {
          if (dp[i][j][k - 1] != 0) {
            if (i - 1 >= 0 && j - 1 >= 0 && dp[i - 1][j - 1][k - 1] == 1)
              dp[i][j][k] = 1;
            if (i - 1 >= 0 && dp[i - 1][j][k - 1] == 1) dp[i][j][k] = 1;
            if (i - 1 >= 0 && j + 1 < 8 && dp[i - 1][j + 1][k - 1] == 1)
              dp[i][j][k] = 1;
            if (j - 1 >= 0 && dp[i][j - 1][k - 1] == 1) dp[i][j][k] = 1;
            if (dp[i][j][k - 1] == 1) dp[i][j][k] = 1;
            if (j + 1 < 8 && dp[i][j + 1][k - 1] == 1) dp[i][j][k] = 1;
            if (i + 1 < 8 && j - 1 >= 0 && dp[i + 1][j - 1][k - 1] == 1)
              dp[i][j][k] = 1;
            if (i + 1 < 8 && dp[i + 1][j][k - 1] == 1) dp[i][j][k] = 1;
            if (i + 1 < 8 && j + 1 < 8 && dp[i + 1][j + 1][k - 1] == 1)
              dp[i][j][k] = 1;
          }
        }
      }
    }
  }
  int flag = 0;
  for (int i = 0; i < 8; i++)
    for (int j = 0; j < 8; j++)
      if (dp[i][j][8] == 1) flag = 1;
  if (flag)
    cout << "WIN\n";
  else
    cout << "LOSE\n";
  return 0;
}
