Wristband Pairs

Festival wristbands are numbered $1, 2, \dots, 60$, each used exactly once. Two wristbands form a matching pair if their numbers sum to $61$. You grab $k$ distinct wristbands at random. What is the smallest $k$ such that you are guaranteed to hold at least one matching pair, no matter which wristbands you grab?