#include <bits/stdc++.h>
using namespace std;
using namespace std;
template <class T>
void setmax(T &a, T b) {
  if (a < b) a = b;
}
template <class T>
void setmin(T &a, T b) {
  if (b < a) a = b;
}
template <class T>
T Abs(T x) {
  return x > 0 ? x : -x;
}
template <class T>
inline T sqr(T x) {
  return x * x;
}
template <class T>
inline bool isPrime(T n) {
  if (n <= 1) return false;
  for (T i = 2; i * i <= n; i++)
    if (n % i == 0) return false;
  return true;
}
template <class T>
string toString(T n) {
  ostringstream oss;
  oss << n;
  oss.flush();
  return oss.str();
}
int toInt(string s) {
  int r = 0;
  istringstream sin(s);
  sin >> r;
  return r;
}
long long toLl(string s) {
  long long r = 0;
  istringstream sin(s);
  sin >> r;
  return r;
}
double toDouble(string s) {
  double r = 0;
  istringstream sin(s);
  sin >> r;
  return r;
}
bool IsVowel(char ch) {
  ch = tolower(ch);
  if (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u')
    return true;
  return false;
}
bool isUpperCase(char c) { return c >= 'A' && c <= 'Z'; }
bool isLowerCase(char c) { return c >= 'a' && c <= 'z'; }
long long Pow(long long B, long long P) {
  long long R = 1;
  while (P > 0) {
    if (P % 2 == 1) R = (R * B);
    P /= 2;
    B = (B * B);
  }
  return R;
}
int BigMod(long long B, long long P, long long M) {
  long long R = 1;
  while (P > 0) {
    if (P % 2 == 1) {
      R = (R * B) % M;
    }
    P /= 2;
    B = (B * B) % M;
  }
  return (int)R;
}
long long mulmod(long long a, long long b, long long c) {
  long long x = 0, y = a % c;
  while (b > 0) {
    if (b % 2 == 1) {
      x = (x + y) % c;
    }
    y = (y * 2) % c;
    b /= 2;
  }
  return x % c;
}
void ASCII_Chart() {
  int i, j, k;
  printf("ASCII Chart:(30-129)\n");
  for (i = 30; i < 50; i++) {
    for (j = 0; j < 5; j++) {
      k = i + j * 20;
      printf("%3d---> '%c'   ", k, k);
    }
    printf("\n");
  }
}
double deg2rad(double x) { return (3.141592653589793 * x) / 180.0; }
double rad2deg(double x) { return (180.0 * x) / 3.141592653589793; }
long long ax[] = {1, 1, 0, -1, -1, -1, 0, 1};
long long ay[] = {0, 1, 1, 1, 0, -1, -1, -1};
struct Ind {
  long long x, y;
  Ind() {}
  Ind(long long xx, long long yy) {
    x = xx;
    y = yy;
  }
};
long long i, j, k;
long long dis[11][11];
char ch;
vector<pair<long long, long long> > sta;
bool check(long long x, long long y, long long cst) {
  long long siz = sta.size(), dx, dy;
  for (long long i = 0; i < siz; i++) {
    dx = sta[i].first;
    dy = sta[i].second;
    if (x < dx || y != dy) continue;
    if (cst == x - dx) return 0;
    if (cst - 1 == x - dx) return 0;
  }
  return 1;
}
bool bfs() {
  queue<pair<long long, long long> > que;
  que.push(make_pair(7, 0));
  for (i = 0; i <= 8; i++)
    for (j = 0; j <= 8; j++) dis[i][j] = 99999999;
  dis[7][0] = 0;
  long long i, dx, dy, x, y;
  while (!que.empty()) {
    x = que.front().first;
    y = que.front().second;
    if (x == 0 && y == 7) return true;
    que.pop();
    for (i = 0; i < 8; i++) {
      dx = x + ax[i];
      dy = y + ay[i];
      if (dx >= 8 || dy >= 8 || dx < 0 || dy < 0 ||
          dis[dx][dy] <= dis[x][y] + 1)
        continue;
      if (!check(dx, dy, dis[x][y] + 1)) continue;
      que.push(make_pair(dx, dy));
      dis[dx][dy] = dis[x][y] + 1;
    }
    if (check(x, y, dis[x][y] + 1)) {
      que.push(make_pair(x, y));
      dis[x][y]++;
    }
  }
  return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  for (i = 0; i < 8; i++) {
    for (j = 0; j < 8; j++) {
      cin >> ch;
      if (ch == 'S') sta.push_back(make_pair(i, j));
    }
  }
  if (bfs())
    cout << "WIN";
  else
    cout << "LOSE";
  return 0;
}
