#include <iostream>
using namespace std;

int lower_bound(int d, int a[], int n)
{
    int l=0, r=n;
    while (l < r)
    {
       int m = (l+r)/2;  //Important to floor the middle, otherwise it will not work when l+1=r
       if (a[m] < d)
          l = m + 1;
       else
          r = m;
    }
    return l;
}

int main() {
	// your code goes here
	int a[] = {10, 20};
	int d;
	while (cin >> d)
	{
		cout << lower_bound(d, a, (sizeof(a))/(sizeof(a[0]))) << "\n";
	}
	return 0;
}