# Tuples in Python Hacker Rank Solution

Hello coders, In this post, you will learn how to solve the Tuples in Python Hacker Rank Solution. This problem is a part of the Python Hacker Rank series.

## Tuples in Python Hacker Rank Solution

### problem

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) 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.

Sharing Is Caring