#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#include<vector>
int main() {
// your code goes here
vector<int>arr={6,2,3,6,4,5};
unordered_map<int,int>mp;
int k;
cin>>k;
int flag=0;
int n=arr.size();
for(int i=0;i<n;i++)
{
if(mp.find(arr[i])!=mp.end())
{
if(i-mp[arr[i]]<=k)
{
flag=1;
break;
}
}
mp[arr[i]]=i;
}
if(flag==0)
{
cout<<"false";
}else
cout<<"true";
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnR5cGVkZWYgbG9uZyBsb25nIGludCBsbDsKI2luY2x1ZGU8dmVjdG9yPgoKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCiAgICB2ZWN0b3I8aW50PmFycj17NiwyLDMsNiw0LDV9OwoJdW5vcmRlcmVkX21hcDxpbnQsaW50Pm1wOwoJaW50IGs7CgljaW4+Pms7CglpbnQgZmxhZz0wOwoJaW50IG49YXJyLnNpemUoKTsKCWZvcihpbnQgaT0wO2k8bjtpKyspCgkgewoJIAlpZihtcC5maW5kKGFycltpXSkhPW1wLmVuZCgpKQoJIAkgewoJIAkgCWlmKGktbXBbYXJyW2ldXTw9aykKCSAJIAkgewoJIAkgCSAJZmxhZz0xOwoJIAkgCSAJYnJlYWs7CgkgCSAJIH0KCSAJIH0KCSAJIG1wW2FycltpXV09aTsKCSB9CgkgCgkgaWYoZmxhZz09MCkKCSAgewoJICAJY291dDw8ImZhbHNlIjsKCSAgfWVsc2UKCSAgIGNvdXQ8PCJ0cnVlIjsKCSAKCQoJcmV0dXJuIDA7Cn0=