adj6.rb

def f(n)

	n = (n * 3 + 1) if (n.odd?)
	n /= 2 while (n.even?)
	return n
end



n = 8001
l = []
	
1000.times { l << n; n += 2 }

l2  = l.dup

seen = {}
i = 0

begin

	j = (0...l2.size).max_by { |x| l2[x] }
	z = l[j]
	if (seen.member?(z)) then
		l.delete_at(j)
		l2.delete_at(j)
		next
	end
	seen[z] = nil
	l[j] = f(z)
	l2[j] += z
	
	t = 0.0
	l.each { |x| t += x }
	
	puts([t, l.size].join("\t"))

end while (!l.empty?)