There are \(2k+1\) cards numbered with the numbers \(1\) to \(2k+1\). What is the largest number of cards that can be chosen so that no number on a chosen card is equal to the sum of two numbers from two other chosen cards?