#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define For(i,a,b) for (int i = a; i <= b; i ++)
#define Dow(i,a,b) for (int i = b; i >= a; -- i)
const int mod = 998244353;
const int MOD = 1000000007;
const int maxn = 2e5 + 5;
inline ll read()
{
ll t = 0, dp = 1; char c = getchar();
while(!isdigit(c)) {if (c == '-') dp = -1; c = getchar();}
while(isdigit(c)) t = t * 10 + c - 48, c = getchar();
return t * dp;
}
signed main()
{
int X = read();
puts((X > 0 && X % 100 == 0) ? "Yes" : "No");
return 0;
}
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define For(i,a,b) for (int i = a; i <= b; i ++)
#define Dow(i,a,b) for (int i = b; i >= a; -- i)
const int mod = 998244353;
const int MOD = 1000000007;
const int maxn = 2e5 + 5;
inline ll read()
{
ll t = 0, dp = 1; char c = getchar();
while(!isdigit(c)) {if (c == '-') dp = -1; c = getchar();}
while(isdigit(c)) t = t * 10 + c - 48, c = getchar();
return t * dp;
}
signed main()
{
string S; cin >> S; string T = S;
int len = S.size();
string S1 = S, S2 = S;
S += S;
For(i,0,len-1)
{
string tmp = S.substr(i, len);
S1 = min(S1, tmp);
S2 = max(S2, tmp);
}
cout << S1 << "\n" << S2 << "\n";
return 0;
}
// code of JUYU ^ ^ never doubt youself !
#include <bits/stdc++.h>
typedef long long ll;
#define int ll
#define For(i,a,b) for (int i = a; i <= b; i ++)
#define Dow(i,a,b) for (int i = b; i >= a; -- i)
#define ms(a,b) memset(a, b, sizeof (a))
#define fir first
#define sec second
#define mk make_pair
#define pb push_back
#define eb emplace_back
using namespace std;
typedef pair<int,int> PII;
const int mod = 998244353;
const int MOD = 1000000007;
const int maxn = 1e5 + 5;
inline ll read()
{
ll t = 0, dp = 1; char c = getchar();
while(!isdigit(c)) {if (c == '-') dp = -1; c = getchar();}
while(isdigit(c)) t = t * 10 + c - 48, c = getchar();
return t * dp;
}
inline void write(ll x){if (x < 0){putchar('-'); x = -x;} if(x >= 10) write(x / 10); putchar(x % 10 + 48);}
inline void writeln(ll x){write(x); puts("");}
inline void write_p(ll x){write(x); putchar(' ');}
inline void write_b(ll x){putchar(' '); write(x);}
double A[maxn], B[maxn], C[maxn], sum;
signed main()
{
int N = read(); double ans = 0;
int key = 0;
For(i,1,N)
{
scanf("%lf %lf", &A[i], &B[i]);
C[i] = A[i] / B[i];
sum += C[i];
}
sum /= 2.0;
For(i,1,N)
{
if (C[i] < sum)
{
sum -= C[i];
ans += A[i];
}
else
{
ans += (sum / C[i] * A[i]);
break;
}
}
printf("%.15lf\n", ans);
return 0;
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
-- Benq
*/
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int n, m, dist[maxn];
vector<int> g[maxn];
priority_queue<int, vector<int>, greater<int>> q;
vector<int> ret;
bool topsort()
{
for (int i = 1; i <= n; i ++)
{
if (!dist[i]) q.push(i);
}
while (q.size())
{
int u = q.top(); q.pop();
ret.push_back(u);
for (int v : g[u])
{
dist[v] --;
if (dist[v] == 0) q.push(v);
}
}return ret.size() == n;
}
signed main()
{
cin >> n >> m;
for (int i = 0; i < m; i ++)
{
int a, b; cin >> a >> b;
g[a].push_back(b);
dist[b] ++;
}
if (topsort())
{
for (int i = 0; i < ret.size(); i ++) cout << ret[i] << " ";
puts("");
}
else puts("-1");
return 0;
}