#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
struct TPoint {
  T x, y;
  static constexpr T eps = static_cast<T>(1e-9);
  explicit TPoint(T x = 0, T y = 0) : x(x), y(y) {}
  bool operator<(TPoint p) const { return tie(x, y) < tie(p.x, p.y); }
  bool operator==(TPoint p) const {
    return abs(x - p.x) <= eps && abs(y - p.y) <= eps;
  }
  TPoint operator+(TPoint p) const { return TPoint(x + p.x, y + p.y); }
  TPoint operator-(TPoint p) const { return TPoint(x - p.x, y - p.y); }
  TPoint operator*(T d) const { return TPoint(x * d, y * d); }
  TPoint operator/(T d) const { return TPoint(x / d, y / d); }
  T dot(TPoint p) const { return x * p.x + y * p.y; }
  T cross(TPoint p) const { return x * p.y - y * p.x; }
  T cross(TPoint a, TPoint b) const { return (a - *this).cross(b - *this); }
  T dist2() const { return x * x + y * y; }
  double dist() const { return sqrt((double)dist2()); }
  double angle() const { return atan2(y, x); }
  TPoint unit() const { return *this / dist(); }
  TPoint perp() const { return TPoint(-y, x); }
  TPoint normal() const { return perp().unit(); }
  TPoint rotate(double a) const {
    return TPoint(x * cos(a) - y * sin(a), x * sin(a) + y * cos(a));
  }
  inline bool is_upper() const {
    return (y > eps || (abs(y) <= eps && x > eps));
  }
  inline int cmp_polar(const TPoint& rhs) const {
    bool a = is_upper();
    bool b = rhs.is_upper();
    if (a != b) {
      return (a ? -1 : 1);
    }
    T v = x * rhs.y - y * rhs.x;
    return (v > eps ? -1 : (v < -eps ? 1 : 0));
  }
};
using Point = TPoint<ll>;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int N;
  cin >> N;
  vector<Point> points(N);
  vector<bool> used(N);
  for (int i = 0; i < N; i++) {
    cin >> points[i].x >> points[i].y;
  }
  string S;
  cin >> S;
  S.push_back('L');
  int id = -1;
  for (int i = 0; i < N; i++) {
    if (id == -1 || points[id].x > points[i].x ||
        (points[id].x == points[i].x && points[id].y > points[i].y))
      id = i;
  }
  used[id] = true;
  cout << id + 1 << ' ';
  for (int it = 1; it < N; it++) {
    int to = -1;
    for (int i = 0; i < N; i++) {
      if (!used[i]) {
        if (to == -1) {
          to = i;
        } else {
          ll now = points[id].cross(points[i], points[to]);
          if (S[it - 1] == 'R') now = -now;
          if (now > 0) to = i;
        }
      }
    }
    used[to] = true;
    id = to;
    cout << (id + 1) << " ";
  }
  cout << '\n';
}
