We prove that in a word of length n over an alphabet of k letters there are l disjoints identical (scattered) subwords of length n/l/o(n) for l \geq k. E.g., any binary word of length n can be split into two identical subwords (referred to as twins) and, perhaps, a remaining subword of length o(n).