def scan; gets.split.map(&:to_i); end # abababa def func(nu) m = (nu+2) / 2 ke = m*(m-1)-m+1 return (nu.even? ? ke+nu/2 : ke) + nu end n = gets.to_i puts "🍣" if n <= 0 iwi = ['a','b'] while n > 3 # binary search c = nil l = 0; h = 100000 while l < h c = (l+h+1)/2; if (n < func(c)) h = c-1 else l = c end end k = l n -= func(l) print ((iwi[0]+iwi[1])*((k)/2)) print iwi[0] if k.odd? iwi.map!(&:succ!) end print 'xyz'[0..(n-1)] if 0 < n