华南理工大学“三七互娱杯”程序设计竞赛（重现赛）F HRY and ec-final

链接：https://ac.nowcoder.com/acm/contest/874/F
来源：牛客网
 

题目描述

yang12138 participated in the ec-final of 8102. Though he was good at number theory, he did not succeed in solving one of the number theory problem. This made him feel very angry. After the contest, he came up with a more difficult (?) number theory problem. He was so mad that he took the problem to this contest. Can you solve it?

 

There is an integer sequence S(index from 1) of length 109109, which is composed of : ϕ(1),ϕ(2),...,ϕ(999999999),ϕ(1000000000)ϕ(1),ϕ(2),...,ϕ(999999999),ϕ(1000000000)

where ϕ(n)ϕ(n) represents the Euler function of n.

 

The definition of the Euler function is given below:

ϕ(n)ϕ(n) = Number of integers in 1-n which is coprime with n.
The Euler function values of 1,2,...,9,10 are 1,1,2,2,4,2,6,4,6,4