You are given a list of n-1 integers and these integers are in the range of 1 to n. There are no duplicates in list. One of the integers is missing in the list. Write an efficient code to find the missing integer.
I/P [1, 2, 4, ,6, 3, 7, 8]
O/P 5