#include <bits/stdc++.h>
using namespace std;
vector<string> ar;
int solved = 0;
void moveStatues(vector<pair<int, int> > &v) {
  for (int i = 0; i < v.size(); i++) {
    v[i].first++;
  }
}
int checkOnStatue(int i, int j, vector<pair<int, int> > v) {
  for (int k = 0; k < v.size(); k++) {
    if (i == v[k].first && j == v[k].second) {
      return 1;
    }
  }
  return 0;
}
int dfs(int i, int j, vector<pair<int, int> > v, vector<vector<int> > used) {
  if (i < 0 || j < 0 || j >= 8 || i >= 8 || used[i][j]) {
    return 0;
  }
  if (checkOnStatue(i, j, v)) {
    return 0;
  }
  if (i == 0 && j == 7) {
    solved = 1;
    return 1;
  }
  moveStatues(v);
  if (checkOnStatue(i, j, v)) {
    return 0;
  }
  int x = 0;
  used[i][j] = 1;
  x = max(dfs(i - 1, j, v, used), x);
  if (solved) return 1;
  x = max(dfs(i, j + 1, v, used), x);
  if (solved) return 1;
  x = max(dfs(i, j - 1, v, used), x);
  if (solved) return 1;
  x = max(dfs(i + 1, j, v, used), x);
  if (solved) return 1;
  x = max(dfs(i + 1, j + 1, v, used), x);
  if (solved) return 1;
  x = max(dfs(i + 1, j - 1, v, used), x);
  if (solved) return 1;
  x = max(dfs(i - 1, j + 1, v, used), x);
  if (solved) return 1;
  x = max(dfs(i - 1, j - 1, v, used), x);
  if (solved) return 1;
  x = max(dfs(i, j, v, used), x);
  if (solved) return 1;
  return x;
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  int n, m, k, r, i, j, temp, temp1, temp2, temp3, x, x1, x2, x3;
  string str;
  vector<vector<int> > used;
  vector<int> asd(8);
  for (i = 0; i < 8; i++) {
    used.push_back(asd);
  }
  vector<pair<int, int> > v;
  for (i = 0; i < 8; i++) {
    cin >> str;
    ar.push_back(str);
    for (j = 0; j < 8; j++) {
      if (str[j] == 'S') {
        v.push_back(make_pair(i, j));
      }
    }
  }
  x = 0;
  x = dfs(7, 0, v, used);
  if (x == 1) {
    cout << "WIN" << endl;
    return 0;
  }
  x = dfs(6, 0, v, used);
  if (x == 1) {
    cout << "WIN" << endl;
    return 0;
  }
  x = dfs(6, 1, v, used);
  if (x == 1) {
    cout << "WIN" << endl;
    return 0;
  }
  x = dfs(7, 1, v, used);
  if (x == 1) {
    cout << "WIN" << endl;
    return 0;
  } else {
    cout << "LOSE" << endl;
  }
}
