# Tuples in Python – Hacker Rank Solution

Given an integer, n, and n space-separated integers as input, create a tuple, t, of those n integers. Then compute and print the result of hash(t).

Note:Â hash()Â is one of the functions in the __builtins__ module, so it need not be imported.

Input Format

The first line contains an integer, n, denoting the number of elements in the tuple.
The second line contains n space-separated integers describing the elements in tuple t.

Output Format

Print the result of hash(t).

Sample Input 0

```2
1 2
```

Sample Output 0

`3713081631934410656`

### Tuples in Python – Hacker Rank Solution

```if __name__ == '__main__':
n = int(input())
integer_list = map(int, input().split())
# Tuples in Python - Hacker Rank Solution START
t = tuple(integer_list)
print(hash(t));
# Tuples in Python - Hacker Rank Solution END```

Disclaimer:Â The above ProblemÂ (Tuples in Python – Hacker Rank Solution)Â is generated byÂ Hackerrank but the Solution is Provided byÂ Chase2Learn. This tutorial is only forÂ EducationalÂ andÂ LearningÂ purposes. Authority if any of the queries regarding this post or website fill the following contact form thank you.

Scroll to Top