#include<bits/stdc++.h>

using namespace std;

char s[20], s1[20];

int main() {

	while ((~scanf("%s", s)) && s[0] == 's') {

		int x = 0, y = 1;

		while (true) {

			printf("? %d %d\n", x, y);

			fflush(stdout);

			scanf("%s", s1);

			if (s1[0] == 'x')

				break;

			x = y, y = y * 2 + 1;

		}

		int mid, l = x, r = y;

		while (l + 1 < r) {

			mid = l + r >> 1;

			printf("? %d %d\n", l, mid);

			fflush(stdout);

			scanf("%s", s1);

			if (s1[0] == 'x')

				r = mid;

			else

				l = mid;

		}

		if (l == 0) {

			printf ("! 1\n");

			fflush(stdout);

			continue;

		}

		printf("? %d %d\n", r, r + 1);

		fflush(stdout);

		scanf("%s", s1);

		if (s1[0] == 'x')

			r --;

		printf("! %d\n",r);

		fflush(stdout);

	}

	return 0;

}

#include <bits/stdc++.h>

using namespace std;

int n, t, r, mid, l;

inline int find (int x) {

	printf("? %d\n", x + 1);

	fflush(stdout);

	scanf("%d", &x);

	return x;

}

int main() {

	scanf("%d", &n);

	t = n / 2;

	if (t & 1) {

		printf("! -1\n");

		return 0;

	}

	r = n - 1;

	while (l < r) {

		mid = l + r >> 1;

		if (find(mid) - find((mid + t) % n) >= 0)

			r = mid;

		else

			l = mid + 1;

	}

	printf("! %d", l + 1);

	fflush(stdout);

	return 0;

}

#include <bits/stdc++.h>

using namespace std;

int a[1005], n, m, c, x;

int main() {

    scanf("%d%d%d", &n, &m, &c);

    int i;

    while(m --) {

        scanf("%d", &x);

        if(x > c / 2)

            for (i = n; a[i] >= x; -- i);

        else

            for (i = 1; a[i] && a[i] <= x; ++ i);

        printf("%d\n", i);

        fflush(stdout);

        a[i] = x;

        for (i = 1; i <= n && a[i]; ++ i);

        if (i > n)

            break;

    }

    return 0;

}