Each function from a k-element set K to an n-element set N is a function from K onto some subset of N. If J is a subset of N of size j, you know how to compute the number of functions that map onto J in terms of Stirling numbers. Suppose you add the number of functions mapping onto J over all possible subsets J of N. What simple value should this sum equal?