【入门】A类多？B类多？
#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
} #include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}#include
using namespace std;
int main(){
int zhi;
scanf("%d",&zhi);
int ge_shu=0;
for(int m=1;m<=zhi;m++){
int n;
n=m;
if(n==0){
}
else{
int count_1=0;
int count_0=0;
for(int i=0; ;i++){
if(n%2==0){
n/=2;
count_0++;
}
else if(n%2==1){
n/=2;
count_1++;
}
if(n==0)
break;
}
if(count_1>count_0){
ge_shu++;
}
}
}
printf("%d %d",ge_shu,zhi-ge_shu);
return 0;
}