
from collections import Counter

import numpy as np
from sklearn import datasets
from sklearn.model_selection import train_test_split

lowerCamelCase_		      =	datasets.load_iris()

lowerCamelCase_		      =	np.array(data['''data'''])
lowerCamelCase_		      =	np.array(data['''target'''])
lowerCamelCase_		      =	data['target_names']

lowerCamelCase_		      =	train_test_split(X, y)






def 		__magic_name__					(       __a     :			Any			,						__a     :			int		):



     '''simple docstring'''




     return np.linalg.norm(np.array(__a		) - np.array(__a		)		)






def 		__magic_name__					(       __a     :			Dict			,						__a     :			Optional[Any]			,						__a     :			Any			,						__a     :			str			,						__a     :			int=5		):



     '''simple docstring'''




     UpperCamelCase__												=							zip(__a			,						__a		)
     # List of distances of all points from the point to be classified
     UpperCamelCase__												=							[]
     for data_point in data:
          UpperCamelCase__												=							euclidean_distance(data_point[0]			,						__a		)
          distances.append((distance, data_point[1])		)
     # Choosing 'k' points with the least distances.
     UpperCamelCase__												=							[i[1] for i in sorted(__a		)[:k]]
     # Most commonly occurring class among them
     # is the class into which the point is classified
     UpperCamelCase__												=							Counter(__a		).most_common(1		)[0][0]
     return classes[result]


if __name__ == "__main__":
    print(classifier(X_train, y_train, classes, [4.4, 3.1, 1.3, 1.4]))








'''simple docstring'''




from __future__ import annotations


def    lowerCamelCase__		(    SCREAMING_SNAKE_CASE   : int | str    ):
  UpperCAmelCase    				=						str(SCREAMING_SNAKE_CASE    )
  return n == n[::-1]


def    lowerCamelCase__		(    SCREAMING_SNAKE_CASE   : int = 100_0000    ):
  UpperCAmelCase    				=						0

  for i in range(1							, SCREAMING_SNAKE_CASE    ):
    if is_palindrome(SCREAMING_SNAKE_CASE    ) and is_palindrome(bin(SCREAMING_SNAKE_CASE    ).split('b'    )[1]    ):
      total += i
  return total


if __name__ == "__main__":
  print(solution(int(str(input().strip()))))


