<jupyter_start><jupyter_text>https://www.hackerrank.com/challenges/py-set-intersection-operation/problem<jupyter_code>first_input_that_the_problem_abolutely_dont_need = int(input())
set_1 = set(input().split())
second_input_that_the_problem_abolutely_dont_need = int(input())
print(len(set_1.intersection(set(input().split()))))<jupyter_output>9
1 2 3 4 5 6 7 8 9
9
10 1 2 3 11 21 55 6 8
5
{'fraction_non_alphanumeric': 0.13110539845758354, 'fraction_numerical': 0.06940874035989718, 'mean_word_length': 8.069767441860465, 'pattern_counts': {'":': 0, '<': 4, '<?xml version=': 0, '>': 4, 'https://': 1, 'lorem ipsum': 0, 'www.': 1, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'chain_length': '1', 'dir': 'jupyter-structured-clean-dedup', 'id': '566820', 'license': 'MIT', 'n_tokens_mistral': 181, 'n_tokens_neox': 155, 'n_words': 27, 'path': '04 - Sets/06 - Set .intersection() Operation.ipynb', 'repo_name': 'naveen-kumar-123/Python-Challenges--HackerRank', 'size': '389'}