object Main {
  def main(args: Array[String]): Unit = {
    val s = new Main()
    s.solve()
    s.out.flush()
  }
}

class Main {
  import java.io._
  import java.util.StringTokenizer

  import scala.collection.mutable
  import scala.util.Sorting
  import math.{abs, max, min}
  import mutable.{ArrayBuffer, ListBuffer}
  import scala.reflect.ClassTag

  val MOD = 1000000007
  val out = new PrintWriter(System.out)

  def solve(): Unit = {
    val N = ni()

    // Male: 0, Female: 1
    val res = Array.ofDim[Int](N + 1)
    case class Ans(i: Int)

    def query(i: Int): Either[Ans, Int] = {
//      debug(s"query $i")
      out.println(i)
      out.flush()

      ns() match {
        case "Vacant" => Left(Ans(i))
        case "Male" => Right(0)
        case "Female" => Right(1)
      }
    }

    /**
      * l, r は調査済みで、この範囲にVacantが必ずある
      * 長さが偶のときは必ずres(l) != res(r)
      * 長さが奇のときは必ずres(l) == res(r)
      * になる
      */
    def step(l: Int, r: Int): Either[Ans, Int] = {
      val mid = (l + r) / 2
      query(mid).right flatMap { x =>
        res(mid) = x
//        debug(s"resp $mid $x")

        // stepが呼ばれる前提からうまいことどっちかが必ずparityとmodがずれる
        if ((mid - l) % 2 != (res(l) ^ res(mid)))
          step(l, mid)
        else
          step(mid, r)
      }
    }

    /*
    最初は必ず奇数スタートなので
    1 -even- 1 -odd- 1 => 1 -odd- 1
    1 -even- 0 -odd- 1 => 1 -even- 0
    どっちかになる

    1 -even- 0 => 1 -even- 1 -even- 0 または 1 -even- 0 -even- 0  どちらかが event && parityが違う
    1 -odd- 1 の方ならスタートと同じ
     */

    def start(a0: Int, am: Int) = {
//      debug(s"start 0:$a0 ${N/2}:$am")
      res(0) = a0
      res(N) = a0
      res(N / 2) = am

      // parityとmodがおかしい側に移る
      if (res(0) == res(N / 2)) {
        if (N / 2 % 2 == 1) step(0, N/ 2)
        else step(N/ 2, N)
      } else {
        if (N / 2 % 2 == 0) step(0, N/ 2)
        else step(N/ 2, N)
      }
    }

    val ans = for {
      a0 <- query(0).right
      am <- query(N / 2).right
      ans <- start(a0, am).right
    } yield ans

    assert(ans.isLeft)
  }


  def debug(as: Array[Boolean]): Unit = {
    System.err.println(as.map(x => if(x) "1" else "0").mkString)
  }

  def debug(as: Array[Int]): Unit = {
    System.err.println(as.mkString(" "))
  }

  def debug(as: Array[Long]): Unit = {
    System.err.println(as.mkString(" "))
  }

  def debug(s: String): Unit = {
    System.err.println(s)
  }

  def debug(num: Long): Unit = {
    System.err.println(num)
  }

  class InputReader(val stream: InputStream) {
    private val reader = new BufferedReader(new InputStreamReader(stream), 32768)
    private var tokenizer: StringTokenizer = _

    def next(): String = {
      while (tokenizer == null || !tokenizer.hasMoreTokens)
        tokenizer = new StringTokenizer(reader.readLine)
      tokenizer.nextToken
    }

    def nextInt(): Int = next().toInt
    def nextLong(): Long = next().toLong
    def nextChar(): Char = next().charAt(0)
  }
  val sc = new InputReader(System.in)
  def ni(): Int = sc.nextInt()
  def nl(): Long = sc.nextLong()
  def nc(): Char = sc.nextChar()
  def ns(): String = sc.next()
  def ns(n: Int): Array[Char] = ns().toCharArray
  def na(n: Int, offset: Int = 0): Array[Int] = map(n)(_ => ni() + offset)
  def na2(n: Int, offset: Int = 0): (Array[Int], Array[Int]) = {
    val A1, A2 = Array.ofDim[Int](n)
    REP(n) { i =>
      A1(i) = ni() + offset
      A2(i) = ni() + offset
    }
    (A1, A2)
  }
  def nm(n: Int, m: Int): Array[Array[Int]] = {
    val A = Array.ofDim[Int](n, m)
    REP(n) { i =>
      REP(m) { j =>
        A(i)(j) = ni()
      }
    }
    A
  }
  def nal(n: Int): Array[Long] = map(n)(_ => nl())
  def nm_c(n: Int, m: Int): Array[Array[Char]] = map(n) (_ => ns(m))
  def REP(n: Int, offset: Int = 0)(f: Int => Unit): Unit = {
    var i = offset
    val N = n + offset
    while(i < N) { f(i); i += 1 }
  }
  def REP_r(n: Int, offset: Int = 0)(f: Int => Unit): Unit = {
    var i = n - 1 + offset
    while(i >= offset) { f(i); i -= 1 }
  }

  def map[@specialized A: ClassTag](n: Int, offset: Int = 0)(f: Int => A): Array[A] = {
    val res = Array.ofDim[A](n)
    REP(n)(i => res(i) = f(i + offset))
    res
  }


  def sumL(as: Array[Int]): Long = {
    var s = 0L
    REP(as.length)(i => s += as(i))
    s
  }

  def cumSum(as: Array[Int]) = {
    val cum = Array.ofDim[Long](as.length + 1)
    REP(as.length) { i =>
      cum(i + 1) = cum(i) + as(i)
    }
    cum
  }
}


Measured memory_bytes: 27692