#include <iostream>
#include<bits/stdc++.h>
using ll = long long int;
#define fo(i,start,end) for(int i=start;i<=end;i++)
using namespace std;

int main() {
	int arr[] = {3,2,4,3,1};
	int k = 3; //input given,distance
	int n = 5; //size
	fo(i,0,n){
		for(int j=i+1;j<n && j<=i+k;j++){
			//j-i <= k according to the question
			//=> j <= i+k
			if(arr[i] == arr[j]){
				cout<<"True"<<endl;
				return 0 ;
			}
		} 
	}
	cout<<"False"<<endl;
	return 0;
}